/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/acceleratedInterpolationWernerOverapprox_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-24 04:17:56,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 04:17:56,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 04:17:56,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 04:17:56,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 04:17:57,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 04:17:57,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 04:17:57,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 04:17:57,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 04:17:57,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 04:17:57,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 04:17:57,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 04:17:57,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 04:17:57,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 04:17:57,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 04:17:57,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 04:17:57,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 04:17:57,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 04:17:57,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 04:17:57,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 04:17:57,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 04:17:57,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 04:17:57,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 04:17:57,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 04:17:57,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 04:17:57,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 04:17:57,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 04:17:57,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 04:17:57,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 04:17:57,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 04:17:57,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 04:17:57,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 04:17:57,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 04:17:57,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 04:17:57,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 04:17:57,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 04:17:57,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 04:17:57,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 04:17:57,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 04:17:57,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 04:17:57,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 04:17:57,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-24 04:17:57,132 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 04:17:57,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 04:17:57,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 04:17:57,138 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 04:17:57,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 04:17:57,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 04:17:57,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 04:17:57,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 04:17:57,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 04:17:57,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 04:17:57,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 04:17:57,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 04:17:57,141 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 04:17:57,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 04:17:57,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 04:17:57,142 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 04:17:57,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 04:17:57,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 04:17:57,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 04:17:57,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 04:17:57,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 04:17:57,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 04:17:57,144 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-24 04:17:57,144 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-02-24 04:17:57,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 04:17:57,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 04:17:57,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 04:17:57,600 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 04:17:57,600 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 04:17:57,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2021-02-24 04:17:57,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e121c87c/ebc6f41dde5342288ee87dc65b3fa441/FLAGcdd1a01c6 [2021-02-24 04:17:58,286 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 04:17:58,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2021-02-24 04:17:58,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e121c87c/ebc6f41dde5342288ee87dc65b3fa441/FLAGcdd1a01c6 [2021-02-24 04:17:58,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e121c87c/ebc6f41dde5342288ee87dc65b3fa441 [2021-02-24 04:17:58,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 04:17:58,634 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 04:17:58,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 04:17:58,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 04:17:58,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 04:17:58,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:58,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7892f678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58, skipping insertion in model container [2021-02-24 04:17:58,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:58,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 04:17:58,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 04:17:58,900 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2021-02-24 04:17:58,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 04:17:58,915 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 04:17:58,942 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c[2881,2894] [2021-02-24 04:17:58,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 04:17:58,969 INFO L208 MainTranslator]: Completed translation [2021-02-24 04:17:58,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58 WrapperNode [2021-02-24 04:17:58,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 04:17:58,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 04:17:58,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 04:17:58,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 04:17:58,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:58,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:58,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:59,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:59,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:59,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:59,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... [2021-02-24 04:17:59,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 04:17:59,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 04:17:59,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 04:17:59,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 04:17:59,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 04:17:59,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 04:17:59,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 04:17:59,194 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 04:17:59,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 04:17:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 04:17:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 04:17:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 04:17:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 04:17:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-24 04:17:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 04:17:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 04:17:59,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 04:17:59,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 04:17:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 04:17:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 04:17:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 04:17:59,744 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 04:17:59,744 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-02-24 04:17:59,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:17:59 BoogieIcfgContainer [2021-02-24 04:17:59,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 04:17:59,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 04:17:59,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 04:17:59,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 04:17:59,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 04:17:58" (1/3) ... [2021-02-24 04:17:59,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a841f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:17:59, skipping insertion in model container [2021-02-24 04:17:59,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 04:17:58" (2/3) ... [2021-02-24 04:17:59,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a841f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 04:17:59, skipping insertion in model container [2021-02-24 04:17:59,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 04:17:59" (3/3) ... [2021-02-24 04:17:59,761 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2021-02-24 04:17:59,779 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 04:17:59,786 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-24 04:17:59,815 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-24 04:17:59,839 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 04:17:59,839 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 04:17:59,839 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-24 04:17:59,839 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 04:17:59,840 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 04:17:59,840 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 04:17:59,840 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 04:17:59,840 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 04:17:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2021-02-24 04:17:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-02-24 04:17:59,869 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:17:59,871 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] [2021-02-24 04:17:59,871 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:17:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:17:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash -734651465, now seen corresponding path program 1 times [2021-02-24 04:17:59,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:17:59,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1139419518] [2021-02-24 04:17:59,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:17:59,982 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:00,202 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:00,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:00,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:00,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:00,239 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:00,240 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:00,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:00,354 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:00,356 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:00,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1139419518] [2021-02-24 04:18:00,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:00,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:00,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880677387] [2021-02-24 04:18:00,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:00,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:00,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:00,413 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2021-02-24 04:18:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:00,942 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2021-02-24 04:18:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:00,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-02-24 04:18:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:00,965 INFO L225 Difference]: With dead ends: 200 [2021-02-24 04:18:00,966 INFO L226 Difference]: Without dead ends: 136 [2021-02-24 04:18:00,970 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 [2021-02-24 04:18:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-02-24 04:18:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2021-02-24 04:18:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-24 04:18:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2021-02-24 04:18:01,052 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 63 [2021-02-24 04:18:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:01,053 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2021-02-24 04:18:01,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2021-02-24 04:18:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-24 04:18:01,056 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:01,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:18:01,057 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 04:18:01,057 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash -106893304, now seen corresponding path program 1 times [2021-02-24 04:18:01,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:01,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [762144232] [2021-02-24 04:18:01,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:01,062 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:01,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:01,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:01,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,135 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:01,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:01,209 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:01,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [762144232] [2021-02-24 04:18:01,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:01,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:01,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638994661] [2021-02-24 04:18:01,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:01,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:01,225 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand 4 states. [2021-02-24 04:18:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:01,529 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2021-02-24 04:18:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:01,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-24 04:18:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:01,533 INFO L225 Difference]: With dead ends: 162 [2021-02-24 04:18:01,533 INFO L226 Difference]: Without dead ends: 160 [2021-02-24 04:18:01,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-02-24 04:18:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2021-02-24 04:18:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-24 04:18:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2021-02-24 04:18:01,570 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 64 [2021-02-24 04:18:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:01,571 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2021-02-24 04:18:01,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2021-02-24 04:18:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-24 04:18:01,573 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:01,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:18:01,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 04:18:01,574 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1299113955, now seen corresponding path program 1 times [2021-02-24 04:18:01,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:01,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213282318] [2021-02-24 04:18:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:01,596 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:01,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:01,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:01,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:01,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:01,712 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:01,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:01,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213282318] [2021-02-24 04:18:01,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:01,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:01,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639100826] [2021-02-24 04:18:01,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:01,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:01,727 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand 4 states. [2021-02-24 04:18:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:02,015 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2021-02-24 04:18:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:02,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-24 04:18:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:02,018 INFO L225 Difference]: With dead ends: 314 [2021-02-24 04:18:02,019 INFO L226 Difference]: Without dead ends: 221 [2021-02-24 04:18:02,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-02-24 04:18:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2021-02-24 04:18:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-24 04:18:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2021-02-24 04:18:02,067 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 64 [2021-02-24 04:18:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:02,068 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2021-02-24 04:18:02,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2021-02-24 04:18:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-24 04:18:02,071 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:02,071 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] [2021-02-24 04:18:02,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 04:18:02,071 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash -429978543, now seen corresponding path program 1 times [2021-02-24 04:18:02,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:02,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695380757] [2021-02-24 04:18:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:02,075 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:02,137 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,140 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:02,141 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,142 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:02,148 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,150 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:02,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:02,198 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,203 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:02,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695380757] [2021-02-24 04:18:02,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:02,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:02,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938192318] [2021-02-24 04:18:02,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:02,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:02,212 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand 4 states. [2021-02-24 04:18:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:02,518 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2021-02-24 04:18:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:02,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-24 04:18:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:02,521 INFO L225 Difference]: With dead ends: 267 [2021-02-24 04:18:02,521 INFO L226 Difference]: Without dead ends: 265 [2021-02-24 04:18:02,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-02-24 04:18:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2021-02-24 04:18:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-24 04:18:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 286 transitions. [2021-02-24 04:18:02,582 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 286 transitions. Word has length 65 [2021-02-24 04:18:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:02,582 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 286 transitions. [2021-02-24 04:18:02,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 286 transitions. [2021-02-24 04:18:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-24 04:18:02,588 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:02,588 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] [2021-02-24 04:18:02,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 04:18:02,589 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1617581589, now seen corresponding path program 1 times [2021-02-24 04:18:02,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:02,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [797360744] [2021-02-24 04:18:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:02,593 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:02,672 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,672 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:02,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,674 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:02,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:02,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:02,734 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:02,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:02,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [797360744] [2021-02-24 04:18:02,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:02,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:02,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477750776] [2021-02-24 04:18:02,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:02,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:02,746 INFO L87 Difference]: Start difference. First operand 219 states and 286 transitions. Second operand 4 states. [2021-02-24 04:18:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:03,064 INFO L93 Difference]: Finished difference Result 563 states and 760 transitions. [2021-02-24 04:18:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:03,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-24 04:18:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:03,068 INFO L225 Difference]: With dead ends: 563 [2021-02-24 04:18:03,068 INFO L226 Difference]: Without dead ends: 385 [2021-02-24 04:18:03,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-02-24 04:18:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2021-02-24 04:18:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-24 04:18:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 506 transitions. [2021-02-24 04:18:03,148 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 506 transitions. Word has length 65 [2021-02-24 04:18:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:03,148 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 506 transitions. [2021-02-24 04:18:03,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2021-02-24 04:18:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-24 04:18:03,150 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:03,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] [2021-02-24 04:18:03,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 04:18:03,151 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:03,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:03,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1855685988, now seen corresponding path program 1 times [2021-02-24 04:18:03,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:03,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282039616] [2021-02-24 04:18:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:03,154 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:03,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,178 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:03,179 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:03,183 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:03,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:03,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,214 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:03,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282039616] [2021-02-24 04:18:03,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:03,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:03,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839494419] [2021-02-24 04:18:03,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:03,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:03,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:03,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:03,222 INFO L87 Difference]: Start difference. First operand 383 states and 506 transitions. Second operand 4 states. [2021-02-24 04:18:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:03,525 INFO L93 Difference]: Finished difference Result 467 states and 620 transitions. [2021-02-24 04:18:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:03,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-24 04:18:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:03,529 INFO L225 Difference]: With dead ends: 467 [2021-02-24 04:18:03,530 INFO L226 Difference]: Without dead ends: 465 [2021-02-24 04:18:03,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-02-24 04:18:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2021-02-24 04:18:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-24 04:18:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 502 transitions. [2021-02-24 04:18:03,607 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 502 transitions. Word has length 66 [2021-02-24 04:18:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:03,609 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 502 transitions. [2021-02-24 04:18:03,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 502 transitions. [2021-02-24 04:18:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-24 04:18:03,611 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:03,611 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] [2021-02-24 04:18:03,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 04:18:03,611 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1394824017, now seen corresponding path program 1 times [2021-02-24 04:18:03,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:03,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681478729] [2021-02-24 04:18:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:03,615 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:03,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:03,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,659 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:03,663 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,663 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:03,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:03,696 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:03,696 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:03,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681478729] [2021-02-24 04:18:03,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:03,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:03,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901298808] [2021-02-24 04:18:03,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:03,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:03,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:03,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:03,704 INFO L87 Difference]: Start difference. First operand 383 states and 502 transitions. Second operand 4 states. [2021-02-24 04:18:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:04,068 INFO L93 Difference]: Finished difference Result 1043 states and 1392 transitions. [2021-02-24 04:18:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:04,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-24 04:18:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:04,073 INFO L225 Difference]: With dead ends: 1043 [2021-02-24 04:18:04,074 INFO L226 Difference]: Without dead ends: 701 [2021-02-24 04:18:04,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-02-24 04:18:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 699. [2021-02-24 04:18:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-24 04:18:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2021-02-24 04:18:04,208 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 66 [2021-02-24 04:18:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:04,208 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2021-02-24 04:18:04,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2021-02-24 04:18:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-24 04:18:04,209 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:04,210 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] [2021-02-24 04:18:04,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-24 04:18:04,210 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1192023845, now seen corresponding path program 1 times [2021-02-24 04:18:04,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:04,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1421207028] [2021-02-24 04:18:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:04,214 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:04,235 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:04,236 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,237 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:04,240 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,241 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:04,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:04,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:04,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1421207028] [2021-02-24 04:18:04,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:04,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:04,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384017556] [2021-02-24 04:18:04,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:04,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:04,280 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand 4 states. [2021-02-24 04:18:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:04,634 INFO L93 Difference]: Finished difference Result 847 states and 1108 transitions. [2021-02-24 04:18:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:04,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-24 04:18:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:04,639 INFO L225 Difference]: With dead ends: 847 [2021-02-24 04:18:04,639 INFO L226 Difference]: Without dead ends: 845 [2021-02-24 04:18:04,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-02-24 04:18:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 699. [2021-02-24 04:18:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-24 04:18:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 906 transitions. [2021-02-24 04:18:04,750 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 906 transitions. Word has length 67 [2021-02-24 04:18:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:04,751 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 906 transitions. [2021-02-24 04:18:04,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 906 transitions. [2021-02-24 04:18:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-24 04:18:04,752 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:04,752 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] [2021-02-24 04:18:04,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-24 04:18:04,753 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 290117663, now seen corresponding path program 1 times [2021-02-24 04:18:04,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:04,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701443063] [2021-02-24 04:18:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:04,756 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:04,775 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,776 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:04,777 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:04,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:04,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:04,809 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:04,810 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:04,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701443063] [2021-02-24 04:18:04,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:04,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:04,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078689708] [2021-02-24 04:18:04,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:04,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:04,817 INFO L87 Difference]: Start difference. First operand 699 states and 906 transitions. Second operand 4 states. [2021-02-24 04:18:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:05,338 INFO L93 Difference]: Finished difference Result 1967 states and 2572 transitions. [2021-02-24 04:18:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:05,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-24 04:18:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:05,346 INFO L225 Difference]: With dead ends: 1967 [2021-02-24 04:18:05,346 INFO L226 Difference]: Without dead ends: 1309 [2021-02-24 04:18:05,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-02-24 04:18:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1307. [2021-02-24 04:18:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-24 04:18:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1674 transitions. [2021-02-24 04:18:05,554 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1674 transitions. Word has length 67 [2021-02-24 04:18:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:05,554 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1674 transitions. [2021-02-24 04:18:05,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1674 transitions. [2021-02-24 04:18:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-24 04:18:05,556 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:05,556 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] [2021-02-24 04:18:05,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-24 04:18:05,557 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:05,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1181748528, now seen corresponding path program 1 times [2021-02-24 04:18:05,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:05,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [113443775] [2021-02-24 04:18:05,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:05,560 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:05,578 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:05,579 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:05,580 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:05,580 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:05,583 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:05,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:05,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:05,614 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:05,614 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:05,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [113443775] [2021-02-24 04:18:05,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:05,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:05,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291218647] [2021-02-24 04:18:05,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:05,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:05,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:05,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:05,622 INFO L87 Difference]: Start difference. First operand 1307 states and 1674 transitions. Second operand 4 states. [2021-02-24 04:18:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:06,113 INFO L93 Difference]: Finished difference Result 1567 states and 1996 transitions. [2021-02-24 04:18:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:06,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-24 04:18:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:06,123 INFO L225 Difference]: With dead ends: 1567 [2021-02-24 04:18:06,123 INFO L226 Difference]: Without dead ends: 1565 [2021-02-24 04:18:06,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2021-02-24 04:18:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1307. [2021-02-24 04:18:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-24 04:18:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1658 transitions. [2021-02-24 04:18:06,322 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1658 transitions. Word has length 68 [2021-02-24 04:18:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:06,322 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1658 transitions. [2021-02-24 04:18:06,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1658 transitions. [2021-02-24 04:18:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-24 04:18:06,325 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:06,325 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] [2021-02-24 04:18:06,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-24 04:18:06,325 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 403959429, now seen corresponding path program 1 times [2021-02-24 04:18:06,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:06,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042310736] [2021-02-24 04:18:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:06,329 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:06,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:06,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:06,352 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:06,352 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:06,355 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:06,356 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:06,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:06,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:06,386 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:06,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042310736] [2021-02-24 04:18:06,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:06,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:06,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168552280] [2021-02-24 04:18:06,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:06,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:06,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:06,394 INFO L87 Difference]: Start difference. First operand 1307 states and 1658 transitions. Second operand 4 states. [2021-02-24 04:18:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:07,016 INFO L93 Difference]: Finished difference Result 3743 states and 4764 transitions. [2021-02-24 04:18:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:07,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-24 04:18:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:07,029 INFO L225 Difference]: With dead ends: 3743 [2021-02-24 04:18:07,030 INFO L226 Difference]: Without dead ends: 2477 [2021-02-24 04:18:07,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-02-24 04:18:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2475. [2021-02-24 04:18:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-24 04:18:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3082 transitions. [2021-02-24 04:18:07,447 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3082 transitions. Word has length 68 [2021-02-24 04:18:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:07,448 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3082 transitions. [2021-02-24 04:18:07,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3082 transitions. [2021-02-24 04:18:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-24 04:18:07,451 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:07,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:18:07,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-24 04:18:07,452 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:07,453 INFO L82 PathProgramCache]: Analyzing trace with hash 863214073, now seen corresponding path program 1 times [2021-02-24 04:18:07,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:07,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1712079412] [2021-02-24 04:18:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:07,463 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:07,494 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:07,495 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:07,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:07,496 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:07,500 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:07,501 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:07,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:07,549 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:07,549 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:07,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1712079412] [2021-02-24 04:18:07,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:07,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:07,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275744140] [2021-02-24 04:18:07,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:07,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:07,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:07,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:07,563 INFO L87 Difference]: Start difference. First operand 2475 states and 3082 transitions. Second operand 4 states. [2021-02-24 04:18:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:08,232 INFO L93 Difference]: Finished difference Result 2927 states and 3596 transitions. [2021-02-24 04:18:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:08,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-24 04:18:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:08,246 INFO L225 Difference]: With dead ends: 2927 [2021-02-24 04:18:08,247 INFO L226 Difference]: Without dead ends: 2925 [2021-02-24 04:18:08,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2021-02-24 04:18:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2475. [2021-02-24 04:18:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-24 04:18:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3050 transitions. [2021-02-24 04:18:08,591 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3050 transitions. Word has length 69 [2021-02-24 04:18:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:08,591 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3050 transitions. [2021-02-24 04:18:08,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3050 transitions. [2021-02-24 04:18:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-24 04:18:08,594 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:08,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 04:18:08,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-24 04:18:08,594 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -361912749, now seen corresponding path program 1 times [2021-02-24 04:18:08,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:08,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342153547] [2021-02-24 04:18:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:08,597 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:08,614 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:08,615 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:08,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:08,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:08,619 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:08,620 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:08,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:08,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:08,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:08,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342153547] [2021-02-24 04:18:08,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:08,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:08,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247989465] [2021-02-24 04:18:08,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:08,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:08,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:08,656 INFO L87 Difference]: Start difference. First operand 2475 states and 3050 transitions. Second operand 4 states. [2021-02-24 04:18:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:09,944 INFO L93 Difference]: Finished difference Result 7149 states and 8811 transitions. [2021-02-24 04:18:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:09,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-24 04:18:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:09,957 INFO L225 Difference]: With dead ends: 7149 [2021-02-24 04:18:09,958 INFO L226 Difference]: Without dead ends: 2475 [2021-02-24 04:18:09,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2021-02-24 04:18:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2021-02-24 04:18:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-24 04:18:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2922 transitions. [2021-02-24 04:18:10,417 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2922 transitions. Word has length 69 [2021-02-24 04:18:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:10,417 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2922 transitions. [2021-02-24 04:18:10,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2922 transitions. [2021-02-24 04:18:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-24 04:18:10,420 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 04:18:10,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] [2021-02-24 04:18:10,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-24 04:18:10,420 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 04:18:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 04:18:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -421419068, now seen corresponding path program 1 times [2021-02-24 04:18:10,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 04:18:10,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [873921276] [2021-02-24 04:18:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 04:18:10,428 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-24 04:18:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:10,457 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:10,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:10,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:10,459 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 04:18:10,462 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:10,466 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:10,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 04:18:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 04:18:10,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 04:18:10,496 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 04:18:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 04:18:10,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [873921276] [2021-02-24 04:18:10,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 04:18:10,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-24 04:18:10,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156379317] [2021-02-24 04:18:10,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-24 04:18:10,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 04:18:10,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-24 04:18:10,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-24 04:18:10,504 INFO L87 Difference]: Start difference. First operand 2475 states and 2922 transitions. Second operand 4 states. [2021-02-24 04:18:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 04:18:10,897 INFO L93 Difference]: Finished difference Result 2475 states and 2922 transitions. [2021-02-24 04:18:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-24 04:18:10,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-02-24 04:18:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 04:18:10,899 INFO L225 Difference]: With dead ends: 2475 [2021-02-24 04:18:10,899 INFO L226 Difference]: Without dead ends: 0 [2021-02-24 04:18:10,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-24 04:18:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-24 04:18:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-24 04:18:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-24 04:18:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-24 04:18:10,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-02-24 04:18:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 04:18:10,907 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-24 04:18:10,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-24 04:18:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-24 04:18:10,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-24 04:18:10,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-24 04:18:10,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-24 04:18:11,277 WARN L202 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2021-02-24 04:18:11,548 WARN L202 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2021-02-24 04:18:12,220 WARN L202 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-24 04:18:12,811 WARN L202 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-24 04:18:13,280 WARN L202 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-24 04:18:13,827 WARN L202 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-24 04:18:14,430 WARN L202 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-02-24 04:18:14,678 WARN L202 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 85 [2021-02-24 04:18:15,017 WARN L202 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-24 04:18:15,414 WARN L202 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2021-02-24 04:18:15,530 WARN L202 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2021-02-24 04:18:15,704 WARN L202 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-24 04:18:15,896 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 65 [2021-02-24 04:18:16,133 WARN L202 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 34 [2021-02-24 04:18:16,521 WARN L202 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2021-02-24 04:18:16,763 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-24 04:18:16,928 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2021-02-24 04:18:17,342 WARN L202 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-24 04:18:17,493 WARN L202 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 45 [2021-02-24 04:18:17,897 WARN L202 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-24 04:18:18,053 WARN L202 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2021-02-24 04:18:18,662 WARN L202 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 39 [2021-02-24 04:18:18,955 WARN L202 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 31 [2021-02-24 04:18:19,116 WARN L202 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2021-02-24 04:18:20,548 WARN L202 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-24 04:18:29,664 WARN L202 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-24 04:18:31,044 WARN L202 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-24 04:18:31,296 WARN L202 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-24 04:18:31,556 WARN L202 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-24 04:18:32,996 WARN L202 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-24 04:18:36,832 WARN L202 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-24 04:18:37,427 WARN L202 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-24 04:18:37,568 WARN L202 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-24 04:18:37,725 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-24 04:18:39,305 WARN L202 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-24 04:18:39,898 WARN L202 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-24 04:18:40,161 WARN L202 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-24 04:18:43,666 WARN L202 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-24 04:18:43,785 WARN L202 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-24 04:18:47,633 WARN L202 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-24 04:18:48,311 WARN L202 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-24 04:18:48,466 WARN L202 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2021-02-24 04:18:49,056 WARN L202 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-24 04:18:52,550 WARN L202 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-24 04:18:54,129 WARN L202 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-24 04:18:54,432 WARN L202 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-24 04:18:54,814 WARN L202 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-24 04:18:58,270 WARN L202 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-24 04:18:58,949 WARN L202 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-24 04:18:59,091 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-24 04:18:59,096 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-24 04:18:59,097 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-24 04:18:59,097 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-24 04:18:59,097 INFO L192 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: true [2021-02-24 04:18:59,098 INFO L192 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: true [2021-02-24 04:18:59,098 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-24 04:18:59,098 INFO L192 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: true [2021-02-24 04:18:59,098 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-24 04:18:59,098 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2021-02-24 04:18:59,098 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-02-24 04:18:59,099 INFO L192 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: true [2021-02-24 04:18:59,099 INFO L192 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: true [2021-02-24 04:18:59,099 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-24 04:18:59,099 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-24 04:18:59,099 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-24 04:18:59,099 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-24 04:18:59,099 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-24 04:18:59,099 INFO L185 CegarLoopUtils]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse0 .cse7 .cse2) (and .cse6 .cse2 .cse4 .cse3) (and .cse5 .cse7 .cse1 .cse4) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2021-02-24 04:18:59,100 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-24 04:18:59,100 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2021-02-24 04:18:59,100 INFO L185 CegarLoopUtils]: At program point L85(line 85) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2021-02-24 04:18:59,101 INFO L185 CegarLoopUtils]: At program point L110(line 110) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2021-02-24 04:18:59,102 INFO L185 CegarLoopUtils]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2021-02-24 04:18:59,102 INFO L192 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: true [2021-02-24 04:18:59,102 INFO L192 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: true [2021-02-24 04:18:59,102 INFO L192 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: true [2021-02-24 04:18:59,102 INFO L185 CegarLoopUtils]: At program point L69-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2021-02-24 04:18:59,103 INFO L185 CegarLoopUtils]: At program point L94(line 94) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2021-02-24 04:18:59,103 INFO L185 CegarLoopUtils]: At program point L61-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2021-02-24 04:18:59,103 INFO L192 CegarLoopUtils]: At program point L119(lines 7 123) the Hoare annotation is: true [2021-02-24 04:18:59,103 INFO L192 CegarLoopUtils]: At program point L53(lines 53 55) the Hoare annotation is: true [2021-02-24 04:18:59,103 INFO L192 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-02-24 04:18:59,103 INFO L192 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: true [2021-02-24 04:18:59,104 INFO L185 CegarLoopUtils]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-24 04:18:59,104 INFO L192 CegarLoopUtils]: At program point L20-2(line 20) the Hoare annotation is: true [2021-02-24 04:18:59,104 INFO L185 CegarLoopUtils]: At program point L78(line 78) 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 .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (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 .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (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 .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .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 .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2021-02-24 04:18:59,104 INFO L192 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: true [2021-02-24 04:18:59,105 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-24 04:18:59,105 INFO L185 CegarLoopUtils]: At program point L70(line 70) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2021-02-24 04:18:59,105 INFO L185 CegarLoopUtils]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2021-02-24 04:18:59,105 INFO L192 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: true [2021-02-24 04:18:59,105 INFO L185 CegarLoopUtils]: At program point L95(line 95) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2021-02-24 04:18:59,106 INFO L185 CegarLoopUtils]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2021-02-24 04:18:59,106 INFO L192 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: true [2021-02-24 04:18:59,106 INFO L192 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-02-24 04:18:59,106 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2021-02-24 04:18:59,106 INFO L185 CegarLoopUtils]: At program point L104(line 104) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2021-02-24 04:18:59,106 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2021-02-24 04:18:59,106 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-24 04:18:59,107 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2021-02-24 04:18:59,107 INFO L185 CegarLoopUtils]: At program point L121(line 121) the Hoare annotation is: false [2021-02-24 04:18:59,107 INFO L185 CegarLoopUtils]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2021-02-24 04:18:59,107 INFO L192 CegarLoopUtils]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2021-02-24 04:18:59,107 INFO L192 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: true [2021-02-24 04:18:59,107 INFO L192 CegarLoopUtils]: At program point L14(line 14) the Hoare annotation is: true [2021-02-24 04:18:59,107 INFO L192 CegarLoopUtils]: At program point L14-1(line 14) the Hoare annotation is: true [2021-02-24 04:18:59,108 INFO L192 CegarLoopUtils]: At program point L14-2(line 14) the Hoare annotation is: true [2021-02-24 04:18:59,108 INFO L185 CegarLoopUtils]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2021-02-24 04:18:59,108 INFO L192 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: true [2021-02-24 04:18:59,108 INFO L185 CegarLoopUtils]: At program point L122(line 122) the Hoare annotation is: false [2021-02-24 04:18:59,108 INFO L185 CegarLoopUtils]: At program point L89(line 89) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2021-02-24 04:18:59,108 INFO L192 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-02-24 04:18:59,109 INFO L192 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: true [2021-02-24 04:18:59,109 INFO L192 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: true [2021-02-24 04:18:59,109 INFO L185 CegarLoopUtils]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-24 04:18:59,109 INFO L185 CegarLoopUtils]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2021-02-24 04:18:59,109 INFO L192 CegarLoopUtils]: At program point L15(line 15) the Hoare annotation is: true [2021-02-24 04:18:59,110 INFO L185 CegarLoopUtils]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2021-02-24 04:18:59,110 INFO L185 CegarLoopUtils]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2021-02-24 04:18:59,110 INFO L185 CegarLoopUtils]: At program point L65-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2021-02-24 04:18:59,110 INFO L185 CegarLoopUtils]: At program point L90(line 90) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2021-02-24 04:18:59,111 INFO L192 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: true [2021-02-24 04:18:59,111 INFO L185 CegarLoopUtils]: At program point L57-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2021-02-24 04:18:59,111 INFO L185 CegarLoopUtils]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-24 04:18:59,111 INFO L192 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: true [2021-02-24 04:18:59,111 INFO L185 CegarLoopUtils]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2021-02-24 04:18:59,111 INFO L192 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: true [2021-02-24 04:18:59,112 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-24 04:18:59,112 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-24 04:18:59,112 INFO L185 CegarLoopUtils]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2021-02-24 04:18:59,112 INFO L185 CegarLoopUtils]: At program point L66(line 66) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2021-02-24 04:18:59,112 INFO L192 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-02-24 04:18:59,112 INFO L192 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: true [2021-02-24 04:18:59,112 INFO L192 CegarLoopUtils]: At program point L33-2(line 33) the Hoare annotation is: true [2021-02-24 04:18:59,112 INFO L185 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-24 04:18:59,113 INFO L185 CegarLoopUtils]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse1 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse8 .cse6 .cse0 .cse3 .cse5 .cse11) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse11 .cse10) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse11) (and .cse8 .cse6 .cse3 .cse7 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse1 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse3 .cse4 .cse5 .cse11) (and .cse6 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse6 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse8 .cse1 .cse3 .cse7 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse3 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse11 .cse10) (and .cse6 .cse0 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse3 .cse11) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse9 .cse4 .cse11 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse1 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse0 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2021-02-24 04:18:59,113 INFO L192 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: true [2021-02-24 04:18:59,113 INFO L192 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: true [2021-02-24 04:18:59,114 INFO L192 CegarLoopUtils]: At program point L17-2(line 17) the Hoare annotation is: true [2021-02-24 04:18:59,114 INFO L185 CegarLoopUtils]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2021-02-24 04:18:59,114 INFO L192 CegarLoopUtils]: At program point L9(line 9) the Hoare annotation is: true [2021-02-24 04:18:59,114 INFO L185 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2021-02-24 04:18:59,114 INFO L192 CegarLoopUtils]: At program point L34(lines 34 36) the Hoare annotation is: true [2021-02-24 04:18:59,114 INFO L192 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: true [2021-02-24 04:18:59,114 INFO L192 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: true [2021-02-24 04:18:59,114 INFO L192 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: true [2021-02-24 04:18:59,115 INFO L185 CegarLoopUtils]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2021-02-24 04:18:59,115 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-24 04:18:59,115 INFO L185 CegarLoopUtils]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2021-02-24 04:18:59,115 INFO L192 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: true [2021-02-24 04:18:59,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 04:18:59 BoogieIcfgContainer [2021-02-24 04:18:59,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-24 04:18:59,130 INFO L168 Benchmark]: Toolchain (without parser) took 60509.81 ms. Allocated memory was 156.2 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 132.3 MB in the beginning and 528.7 MB in the end (delta: -396.4 MB). Peak memory consumption was 745.4 MB. Max. memory is 8.0 GB. [2021-02-24 04:18:59,131 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 156.2 MB. Free memory is still 130.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 04:18:59,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.30 ms. Allocated memory is still 156.2 MB. Free memory was 131.2 MB in the beginning and 121.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-24 04:18:59,132 INFO L168 Benchmark]: Boogie Preprocessor took 78.54 ms. Allocated memory is still 156.2 MB. Free memory was 121.2 MB in the beginning and 119.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-24 04:18:59,132 INFO L168 Benchmark]: RCFGBuilder took 693.99 ms. Allocated memory is still 156.2 MB. Free memory was 119.6 MB in the beginning and 129.0 MB in the end (delta: -9.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-02-24 04:18:59,132 INFO L168 Benchmark]: TraceAbstraction took 59380.05 ms. Allocated memory was 156.2 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 128.5 MB in the beginning and 528.7 MB in the end (delta: -400.2 MB). Peak memory consumption was 741.2 MB. Max. memory is 8.0 GB. [2021-02-24 04:18:59,134 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.22 ms. Allocated memory is still 156.2 MB. Free memory is still 130.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 332.30 ms. Allocated memory is still 156.2 MB. Free memory was 131.2 MB in the beginning and 121.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 78.54 ms. Allocated memory is still 156.2 MB. Free memory was 121.2 MB in the beginning and 119.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 693.99 ms. Allocated memory is still 156.2 MB. Free memory was 119.6 MB in the beginning and 129.0 MB in the end (delta: -9.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 59380.05 ms. Allocated memory was 156.2 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 128.5 MB in the beginning and 528.7 MB in the end (delta: -400.2 MB). Peak memory consumption was 741.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 48.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1927 SDtfs, 2229 SDslu, 214 SDs, 0 SdLazy, 1391 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2475occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1020 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 97 LocationsWithAnnotation, 97 PreInvPairs, 4777 NumberOfFragments, 13957 HoareAnnotationTreeSize, 97 FomulaSimplifications, 1335593 FormulaSimplificationTreeSizeReduction, 8.3s HoareSimplificationTime, 97 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 39.8s 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...