/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-b7b32d2 [2021-02-22 01:52:44,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-22 01:52:44,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-22 01:52:44,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-22 01:52:44,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-22 01:52:44,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-22 01:52:44,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-22 01:52:44,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-22 01:52:44,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-22 01:52:44,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-22 01:52:44,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-22 01:52:44,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-22 01:52:44,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-22 01:52:44,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-22 01:52:44,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-22 01:52:44,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-22 01:52:44,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-22 01:52:44,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-22 01:52:44,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-22 01:52:44,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-22 01:52:44,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-22 01:52:44,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-22 01:52:44,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-22 01:52:44,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-22 01:52:44,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-22 01:52:44,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-22 01:52:44,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-22 01:52:44,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-22 01:52:44,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-22 01:52:44,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-22 01:52:44,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-22 01:52:44,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-22 01:52:44,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-22 01:52:44,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-22 01:52:44,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-22 01:52:44,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-22 01:52:44,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-22 01:52:44,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-22 01:52:44,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-22 01:52:44,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-22 01:52:44,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-22 01:52:44,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationWernerOverapprox_32.epf [2021-02-22 01:52:44,189 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-22 01:52:44,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-22 01:52:44,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-22 01:52:44,192 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-22 01:52:44,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-22 01:52:44,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-22 01:52:44,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-22 01:52:44,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-22 01:52:44,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-22 01:52:44,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-22 01:52:44,194 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-22 01:52:44,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-22 01:52:44,194 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-22 01:52:44,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-22 01:52:44,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-22 01:52:44,195 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-22 01:52:44,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-22 01:52:44,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-22 01:52:44,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-22 01:52:44,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-22 01:52:44,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-22 01:52:44,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-22 01:52:44,197 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=WERNER_OVERAPPROX [2021-02-22 01:52:44,197 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-22 01:52:44,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-22 01:52:44,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-22 01:52:44,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-22 01:52:44,630 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-22 01:52:44,631 INFO L275 PluginConnector]: CDTParser initialized [2021-02-22 01:52:44,632 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-22 01:52:44,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae3c012f/b514d05dac8a4335a8b16341ca5e4298/FLAGeb90bc8c8 [2021-02-22 01:52:45,424 INFO L306 CDTParser]: Found 1 translation units. [2021-02-22 01:52:45,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2021-02-22 01:52:45,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae3c012f/b514d05dac8a4335a8b16341ca5e4298/FLAGeb90bc8c8 [2021-02-22 01:52:45,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae3c012f/b514d05dac8a4335a8b16341ca5e4298 [2021-02-22 01:52:45,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-22 01:52:45,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-22 01:52:45,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-22 01:52:45,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-22 01:52:45,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-22 01:52:45,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:52:45" (1/1) ... [2021-02-22 01:52:45,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a94712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:45, skipping insertion in model container [2021-02-22 01:52:45,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.02 01:52:45" (1/1) ... [2021-02-22 01:52:45,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-22 01:52:45,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-22 01:52:46,060 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-22 01:52:46,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:52:46,075 INFO L203 MainTranslator]: Completed pre-run [2021-02-22 01:52:46,100 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-22 01:52:46,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-22 01:52:46,118 INFO L208 MainTranslator]: Completed translation [2021-02-22 01:52:46,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46 WrapperNode [2021-02-22 01:52:46,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-22 01:52:46,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-22 01:52:46,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-22 01:52:46,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-22 01:52:46,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (1/1) ... [2021-02-22 01:52:46,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (1/1) ... [2021-02-22 01:52:46,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (1/1) ... [2021-02-22 01:52:46,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (1/1) ... [2021-02-22 01:52:46,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (1/1) ... [2021-02-22 01:52:46,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (1/1) ... [2021-02-22 01:52:46,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (1/1) ... [2021-02-22 01:52:46,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-22 01:52:46,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-22 01:52:46,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-22 01:52:46,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-22 01:52:46,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (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-22 01:52:46,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-22 01:52:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-22 01:52:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-22 01:52:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-22 01:52:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-22 01:52:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-22 01:52:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-22 01:52:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-22 01:52:46,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-22 01:52:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-22 01:52:46,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-22 01:52:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-22 01:52:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-22 01:52:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-22 01:52:46,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-22 01:52:46,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-22 01:52:46,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-22 01:52:46,877 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-02-22 01:52:46,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:52:46 BoogieIcfgContainer [2021-02-22 01:52:46,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-22 01:52:46,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-22 01:52:46,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-22 01:52:46,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-22 01:52:46,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.02 01:52:45" (1/3) ... [2021-02-22 01:52:46,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2df51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:52:46, skipping insertion in model container [2021-02-22 01:52:46,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.02 01:52:46" (2/3) ... [2021-02-22 01:52:46,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2df51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.02 01:52:46, skipping insertion in model container [2021-02-22 01:52:46,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.02 01:52:46" (3/3) ... [2021-02-22 01:52:46,889 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2021-02-22 01:52:46,897 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-22 01:52:46,902 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-22 01:52:46,924 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-22 01:52:46,951 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-22 01:52:46,951 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-22 01:52:46,952 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-22 01:52:46,952 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-22 01:52:46,952 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-22 01:52:46,952 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-22 01:52:46,952 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-22 01:52:46,953 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-22 01:52:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2021-02-22 01:52:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-02-22 01:52:47,006 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:47,007 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-22 01:52:47,008 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -734651465, now seen corresponding path program 1 times [2021-02-22 01:52:47,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:47,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409514395] [2021-02-22 01:52:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:47,113 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:47,341 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:47,343 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:47,345 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:47,346 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:47,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:47,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:47,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:47,439 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:47,441 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:47,458 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-22 01:52:47,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409514395] [2021-02-22 01:52:47,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:47,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:47,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050491393] [2021-02-22 01:52:47,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:47,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:47,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:47,488 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2021-02-22 01:52:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:47,915 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2021-02-22 01:52:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:47,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2021-02-22 01:52:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:47,931 INFO L225 Difference]: With dead ends: 200 [2021-02-22 01:52:47,932 INFO L226 Difference]: Without dead ends: 136 [2021-02-22 01:52:47,936 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-22 01:52:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-02-22 01:52:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2021-02-22 01:52:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-22 01:52:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2021-02-22 01:52:48,015 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 63 [2021-02-22 01:52:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:48,017 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2021-02-22 01:52:48,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2021-02-22 01:52:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-22 01:52:48,019 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:48,020 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-22 01:52:48,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-22 01:52:48,020 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:48,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash -106893304, now seen corresponding path program 1 times [2021-02-22 01:52:48,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:48,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1404263457] [2021-02-22 01:52:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:48,025 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:48,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:48,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,104 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:48,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,111 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:48,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:48,173 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,175 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:48,182 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-22 01:52:48,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1404263457] [2021-02-22 01:52:48,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:48,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:48,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428135182] [2021-02-22 01:52:48,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:48,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:48,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:48,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:48,186 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand 4 states. [2021-02-22 01:52:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:48,514 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2021-02-22 01:52:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:48,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-22 01:52:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:48,518 INFO L225 Difference]: With dead ends: 162 [2021-02-22 01:52:48,518 INFO L226 Difference]: Without dead ends: 160 [2021-02-22 01:52:48,520 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-22 01:52:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-02-22 01:52:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2021-02-22 01:52:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-02-22 01:52:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2021-02-22 01:52:48,556 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 64 [2021-02-22 01:52:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:48,557 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2021-02-22 01:52:48,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2021-02-22 01:52:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-02-22 01:52:48,560 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:48,560 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-22 01:52:48,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-22 01:52:48,560 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1299113955, now seen corresponding path program 1 times [2021-02-22 01:52:48,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:48,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1773575145] [2021-02-22 01:52:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:48,566 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:48,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:48,617 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,618 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:48,621 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,622 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:48,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:48,655 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:48,656 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:48,664 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-22 01:52:48,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1773575145] [2021-02-22 01:52:48,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:48,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:48,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111148667] [2021-02-22 01:52:48,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:48,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:48,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:48,669 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand 4 states. [2021-02-22 01:52:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:48,944 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2021-02-22 01:52:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:48,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-02-22 01:52:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:48,947 INFO L225 Difference]: With dead ends: 314 [2021-02-22 01:52:48,947 INFO L226 Difference]: Without dead ends: 221 [2021-02-22 01:52:48,948 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-22 01:52:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-02-22 01:52:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2021-02-22 01:52:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-22 01:52:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2021-02-22 01:52:48,996 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 64 [2021-02-22 01:52:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:48,996 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2021-02-22 01:52:48,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2021-02-22 01:52:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-22 01:52:48,999 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:48,999 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-22 01:52:48,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-22 01:52:48,999 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:49,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:49,000 INFO L82 PathProgramCache]: Analyzing trace with hash -429978543, now seen corresponding path program 1 times [2021-02-22 01:52:49,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:49,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1718317561] [2021-02-22 01:52:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:49,003 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:49,043 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,044 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:49,044 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:49,048 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,049 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:49,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:49,077 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:49,095 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-22 01:52:49,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1718317561] [2021-02-22 01:52:49,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:49,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:49,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616442321] [2021-02-22 01:52:49,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:49,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:49,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:49,098 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand 4 states. [2021-02-22 01:52:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:49,334 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2021-02-22 01:52:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:49,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-22 01:52:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:49,337 INFO L225 Difference]: With dead ends: 267 [2021-02-22 01:52:49,337 INFO L226 Difference]: Without dead ends: 265 [2021-02-22 01:52:49,338 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-22 01:52:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-02-22 01:52:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2021-02-22 01:52:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2021-02-22 01:52:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 286 transitions. [2021-02-22 01:52:49,430 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 286 transitions. Word has length 65 [2021-02-22 01:52:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:49,431 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 286 transitions. [2021-02-22 01:52:49,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 286 transitions. [2021-02-22 01:52:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-02-22 01:52:49,437 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:49,437 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-22 01:52:49,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-22 01:52:49,438 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1617581589, now seen corresponding path program 1 times [2021-02-22 01:52:49,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:49,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [308189925] [2021-02-22 01:52:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:49,448 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:49,521 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,526 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:49,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,528 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:49,531 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,532 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:49,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:49,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,572 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:49,579 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-22 01:52:49,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [308189925] [2021-02-22 01:52:49,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:49,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:49,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384517874] [2021-02-22 01:52:49,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:49,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:49,583 INFO L87 Difference]: Start difference. First operand 219 states and 286 transitions. Second operand 4 states. [2021-02-22 01:52:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:49,885 INFO L93 Difference]: Finished difference Result 563 states and 760 transitions. [2021-02-22 01:52:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:49,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-02-22 01:52:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:49,889 INFO L225 Difference]: With dead ends: 563 [2021-02-22 01:52:49,889 INFO L226 Difference]: Without dead ends: 385 [2021-02-22 01:52:49,891 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-22 01:52:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-02-22 01:52:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2021-02-22 01:52:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-22 01:52:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 506 transitions. [2021-02-22 01:52:49,964 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 506 transitions. Word has length 65 [2021-02-22 01:52:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:49,965 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 506 transitions. [2021-02-22 01:52:49,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 506 transitions. [2021-02-22 01:52:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-22 01:52:49,966 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:49,967 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-22 01:52:49,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-22 01:52:49,967 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:49,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1855685988, now seen corresponding path program 1 times [2021-02-22 01:52:49,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:49,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2115181874] [2021-02-22 01:52:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:49,970 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:49,997 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,998 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:49,998 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:49,999 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:50,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,003 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:50,028 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,034 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-22 01:52:50,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2115181874] [2021-02-22 01:52:50,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:50,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:50,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677293439] [2021-02-22 01:52:50,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:50,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:50,037 INFO L87 Difference]: Start difference. First operand 383 states and 506 transitions. Second operand 4 states. [2021-02-22 01:52:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:50,313 INFO L93 Difference]: Finished difference Result 467 states and 620 transitions. [2021-02-22 01:52:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:50,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-22 01:52:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:50,317 INFO L225 Difference]: With dead ends: 467 [2021-02-22 01:52:50,317 INFO L226 Difference]: Without dead ends: 465 [2021-02-22 01:52:50,318 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-22 01:52:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-02-22 01:52:50,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 383. [2021-02-22 01:52:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-02-22 01:52:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 502 transitions. [2021-02-22 01:52:50,389 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 502 transitions. Word has length 66 [2021-02-22 01:52:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:50,390 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 502 transitions. [2021-02-22 01:52:50,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 502 transitions. [2021-02-22 01:52:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-22 01:52:50,391 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:50,391 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-22 01:52:50,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-22 01:52:50,392 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1394824017, now seen corresponding path program 1 times [2021-02-22 01:52:50,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:50,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366730988] [2021-02-22 01:52:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:50,395 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:50,419 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,419 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,420 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,420 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:50,423 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,424 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:50,449 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,455 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-22 01:52:50,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366730988] [2021-02-22 01:52:50,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:50,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:50,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193548963] [2021-02-22 01:52:50,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:50,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:50,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:50,458 INFO L87 Difference]: Start difference. First operand 383 states and 502 transitions. Second operand 4 states. [2021-02-22 01:52:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:50,792 INFO L93 Difference]: Finished difference Result 1043 states and 1392 transitions. [2021-02-22 01:52:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:50,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-02-22 01:52:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:50,797 INFO L225 Difference]: With dead ends: 1043 [2021-02-22 01:52:50,797 INFO L226 Difference]: Without dead ends: 701 [2021-02-22 01:52:50,800 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-22 01:52:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-02-22 01:52:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 699. [2021-02-22 01:52:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-22 01:52:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2021-02-22 01:52:50,919 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 66 [2021-02-22 01:52:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:50,919 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2021-02-22 01:52:50,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2021-02-22 01:52:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-22 01:52:50,921 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:50,921 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-22 01:52:50,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-22 01:52:50,921 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1192023845, now seen corresponding path program 1 times [2021-02-22 01:52:50,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:50,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1239406911] [2021-02-22 01:52:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:50,924 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:50,947 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,948 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,948 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:50,953 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,954 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:50,978 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:50,979 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:50,985 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-22 01:52:50,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1239406911] [2021-02-22 01:52:50,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:50,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:50,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904809371] [2021-02-22 01:52:50,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:50,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:50,987 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand 4 states. [2021-02-22 01:52:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:51,294 INFO L93 Difference]: Finished difference Result 847 states and 1108 transitions. [2021-02-22 01:52:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:51,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-22 01:52:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:51,300 INFO L225 Difference]: With dead ends: 847 [2021-02-22 01:52:51,300 INFO L226 Difference]: Without dead ends: 845 [2021-02-22 01:52:51,301 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-22 01:52:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2021-02-22 01:52:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 699. [2021-02-22 01:52:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-02-22 01:52:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 906 transitions. [2021-02-22 01:52:51,410 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 906 transitions. Word has length 67 [2021-02-22 01:52:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:51,410 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 906 transitions. [2021-02-22 01:52:51,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 906 transitions. [2021-02-22 01:52:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-02-22 01:52:51,417 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:51,418 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-22 01:52:51,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-22 01:52:51,418 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:51,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:51,419 INFO L82 PathProgramCache]: Analyzing trace with hash 290117663, now seen corresponding path program 1 times [2021-02-22 01:52:51,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:51,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043499010] [2021-02-22 01:52:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:51,422 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:51,442 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:51,442 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:51,443 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:51,444 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:51,446 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:51,447 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:51,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:51,472 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:51,473 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:51,478 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-22 01:52:51,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043499010] [2021-02-22 01:52:51,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:51,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:51,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995129851] [2021-02-22 01:52:51,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:51,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:51,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:51,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:51,481 INFO L87 Difference]: Start difference. First operand 699 states and 906 transitions. Second operand 4 states. [2021-02-22 01:52:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:51,890 INFO L93 Difference]: Finished difference Result 1967 states and 2572 transitions. [2021-02-22 01:52:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:51,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-02-22 01:52:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:51,898 INFO L225 Difference]: With dead ends: 1967 [2021-02-22 01:52:51,898 INFO L226 Difference]: Without dead ends: 1309 [2021-02-22 01:52:51,900 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-22 01:52:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-02-22 01:52:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1307. [2021-02-22 01:52:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-22 01:52:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1674 transitions. [2021-02-22 01:52:52,121 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1674 transitions. Word has length 67 [2021-02-22 01:52:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:52,122 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1674 transitions. [2021-02-22 01:52:52,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1674 transitions. [2021-02-22 01:52:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-22 01:52:52,124 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:52,124 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-22 01:52:52,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-22 01:52:52,124 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1181748528, now seen corresponding path program 1 times [2021-02-22 01:52:52,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:52,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745230136] [2021-02-22 01:52:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:52,127 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:52,148 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,148 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:52,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:52,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,153 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:52,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:52,185 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,186 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:52,190 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-22 01:52:52,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745230136] [2021-02-22 01:52:52,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:52,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:52,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278622831] [2021-02-22 01:52:52,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:52,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:52,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:52,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:52,192 INFO L87 Difference]: Start difference. First operand 1307 states and 1674 transitions. Second operand 4 states. [2021-02-22 01:52:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:52,658 INFO L93 Difference]: Finished difference Result 1567 states and 1996 transitions. [2021-02-22 01:52:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:52,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-22 01:52:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:52,667 INFO L225 Difference]: With dead ends: 1567 [2021-02-22 01:52:52,667 INFO L226 Difference]: Without dead ends: 1565 [2021-02-22 01:52:52,669 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-22 01:52:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2021-02-22 01:52:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1307. [2021-02-22 01:52:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2021-02-22 01:52:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1658 transitions. [2021-02-22 01:52:52,904 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1658 transitions. Word has length 68 [2021-02-22 01:52:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:52,905 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1658 transitions. [2021-02-22 01:52:52,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1658 transitions. [2021-02-22 01:52:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-02-22 01:52:52,907 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:52,907 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-22 01:52:52,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-22 01:52:52,908 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash 403959429, now seen corresponding path program 1 times [2021-02-22 01:52:52,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:52,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1076414554] [2021-02-22 01:52:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:52,911 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:52,933 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,934 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:52,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:52,939 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,939 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:52,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:52,968 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:52,968 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:52,973 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-22 01:52:52,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1076414554] [2021-02-22 01:52:52,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:52,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:52,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605188686] [2021-02-22 01:52:52,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:52,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:52,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:52,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:52,975 INFO L87 Difference]: Start difference. First operand 1307 states and 1658 transitions. Second operand 4 states. [2021-02-22 01:52:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:53,614 INFO L93 Difference]: Finished difference Result 3743 states and 4764 transitions. [2021-02-22 01:52:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:53,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-02-22 01:52:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:53,628 INFO L225 Difference]: With dead ends: 3743 [2021-02-22 01:52:53,628 INFO L226 Difference]: Without dead ends: 2477 [2021-02-22 01:52:53,632 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-22 01:52:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-02-22 01:52:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2475. [2021-02-22 01:52:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-22 01:52:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3082 transitions. [2021-02-22 01:52:54,062 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3082 transitions. Word has length 68 [2021-02-22 01:52:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:54,062 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3082 transitions. [2021-02-22 01:52:54,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3082 transitions. [2021-02-22 01:52:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-22 01:52:54,065 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:54,065 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-22 01:52:54,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-22 01:52:54,066 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:54,067 INFO L82 PathProgramCache]: Analyzing trace with hash 863214073, now seen corresponding path program 1 times [2021-02-22 01:52:54,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:54,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1938951033] [2021-02-22 01:52:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:54,069 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:54,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:54,092 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:54,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:54,093 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:54,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:54,096 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:54,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:54,122 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:54,122 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:54,130 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-22 01:52:54,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1938951033] [2021-02-22 01:52:54,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:54,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:54,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099577186] [2021-02-22 01:52:54,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:54,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:54,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:54,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:54,132 INFO L87 Difference]: Start difference. First operand 2475 states and 3082 transitions. Second operand 4 states. [2021-02-22 01:52:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:54,874 INFO L93 Difference]: Finished difference Result 2927 states and 3596 transitions. [2021-02-22 01:52:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:54,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-22 01:52:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:54,889 INFO L225 Difference]: With dead ends: 2927 [2021-02-22 01:52:54,889 INFO L226 Difference]: Without dead ends: 2925 [2021-02-22 01:52:54,891 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-22 01:52:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2021-02-22 01:52:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2475. [2021-02-22 01:52:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-22 01:52:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3050 transitions. [2021-02-22 01:52:55,274 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3050 transitions. Word has length 69 [2021-02-22 01:52:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:55,275 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3050 transitions. [2021-02-22 01:52:55,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3050 transitions. [2021-02-22 01:52:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-02-22 01:52:55,277 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:55,277 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-22 01:52:55,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-22 01:52:55,278 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash -361912749, now seen corresponding path program 1 times [2021-02-22 01:52:55,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:55,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90302262] [2021-02-22 01:52:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:55,280 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:55,299 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:55,301 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:55,302 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:55,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:55,305 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:55,306 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:55,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:55,331 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:55,332 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:55,337 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-22 01:52:55,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90302262] [2021-02-22 01:52:55,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:55,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:55,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592097401] [2021-02-22 01:52:55,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:55,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:55,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:55,339 INFO L87 Difference]: Start difference. First operand 2475 states and 3050 transitions. Second operand 4 states. [2021-02-22 01:52:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:56,393 INFO L93 Difference]: Finished difference Result 7149 states and 8811 transitions. [2021-02-22 01:52:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:56,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-02-22 01:52:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:56,407 INFO L225 Difference]: With dead ends: 7149 [2021-02-22 01:52:56,407 INFO L226 Difference]: Without dead ends: 2475 [2021-02-22 01:52:56,418 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-22 01:52:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2021-02-22 01:52:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2021-02-22 01:52:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2021-02-22 01:52:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2922 transitions. [2021-02-22 01:52:56,887 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2922 transitions. Word has length 69 [2021-02-22 01:52:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:56,887 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2922 transitions. [2021-02-22 01:52:56,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2922 transitions. [2021-02-22 01:52:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-02-22 01:52:56,890 INFO L414 BasicCegarLoop]: Found error trace [2021-02-22 01:52:56,890 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-22 01:52:56,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-22 01:52:56,890 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-22 01:52:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-22 01:52:56,891 INFO L82 PathProgramCache]: Analyzing trace with hash -421419068, now seen corresponding path program 1 times [2021-02-22 01:52:56,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-22 01:52:56,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173975266] [2021-02-22 01:52:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-22 01:52:56,893 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-22 01:52:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:56,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:56,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:56,918 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:56,919 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-22 01:52:56,921 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:56,922 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:56,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-22 01:52:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-22 01:52:56,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-22 01:52:56,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-22 01:52:56,954 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-22 01:52:56,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173975266] [2021-02-22 01:52:56,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-22 01:52:56,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-22 01:52:56,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284262939] [2021-02-22 01:52:56,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-22 01:52:56,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-22 01:52:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-22 01:52:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-22 01:52:56,956 INFO L87 Difference]: Start difference. First operand 2475 states and 2922 transitions. Second operand 4 states. [2021-02-22 01:52:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-22 01:52:57,362 INFO L93 Difference]: Finished difference Result 2475 states and 2922 transitions. [2021-02-22 01:52:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-02-22 01:52:57,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-02-22 01:52:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-22 01:52:57,363 INFO L225 Difference]: With dead ends: 2475 [2021-02-22 01:52:57,363 INFO L226 Difference]: Without dead ends: 0 [2021-02-22 01:52:57,369 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-22 01:52:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-22 01:52:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-22 01:52:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-22 01:52:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-22 01:52:57,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-02-22 01:52:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-22 01:52:57,370 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-22 01:52:57,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-22 01:52:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-22 01:52:57,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-22 01:52:57,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-22 01:52:57,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-22 01:52:57,641 WARN L202 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2021-02-22 01:52:57,893 WARN L202 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2021-02-22 01:52:58,597 WARN L202 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-22 01:52:59,324 WARN L202 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-22 01:52:59,870 WARN L202 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-22 01:53:00,470 WARN L202 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-22 01:53:01,138 WARN L202 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-02-22 01:53:01,321 WARN L202 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 85 [2021-02-22 01:53:01,680 WARN L202 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-22 01:53:02,085 WARN L202 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2021-02-22 01:53:02,300 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-22 01:53:02,494 WARN L202 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 65 [2021-02-22 01:53:02,721 WARN L202 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 34 [2021-02-22 01:53:03,002 WARN L202 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 65 [2021-02-22 01:53:03,300 WARN L202 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2021-02-22 01:53:03,423 WARN L202 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 53 [2021-02-22 01:53:03,535 WARN L202 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 41 [2021-02-22 01:53:03,724 WARN L202 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2021-02-22 01:53:03,847 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2021-02-22 01:53:04,208 WARN L202 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-22 01:53:04,362 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 45 [2021-02-22 01:53:04,546 WARN L202 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 34 [2021-02-22 01:53:04,878 WARN L202 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 31 [2021-02-22 01:53:05,048 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2021-02-22 01:53:05,704 WARN L202 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 39 [2021-02-22 01:53:06,008 WARN L202 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 31 [2021-02-22 01:53:06,177 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2021-02-22 01:53:07,335 WARN L202 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-22 01:53:14,390 WARN L202 SmtUtils]: Spent 7.00 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2021-02-22 01:53:15,453 WARN L202 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-22 01:53:15,647 WARN L202 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-22 01:53:15,870 WARN L202 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-22 01:53:16,976 WARN L202 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2021-02-22 01:53:19,911 WARN L202 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-22 01:53:20,361 WARN L202 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-22 01:53:20,464 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-22 01:53:21,776 WARN L202 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-22 01:53:22,217 WARN L202 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-22 01:53:22,412 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-22 01:53:25,078 WARN L202 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-22 01:53:28,050 WARN L202 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-02-22 01:53:28,555 WARN L202 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-22 01:53:29,110 WARN L202 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-02-22 01:53:31,742 WARN L202 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-22 01:53:32,930 WARN L202 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-02-22 01:53:33,158 WARN L202 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2021-02-22 01:53:33,442 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2021-02-22 01:53:36,046 WARN L202 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-02-22 01:53:36,555 WARN L202 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2021-02-22 01:53:36,659 WARN L202 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2021-02-22 01:53:36,665 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-22 01:53:36,665 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-22 01:53:36,665 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-22 01:53:36,665 INFO L192 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: true [2021-02-22 01:53:36,666 INFO L192 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: true [2021-02-22 01:53:36,666 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-22 01:53:36,666 INFO L192 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: true [2021-02-22 01:53:36,666 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-22 01:53:36,666 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2021-02-22 01:53:36,666 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-22 01:53:36,666 INFO L192 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: true [2021-02-22 01:53:36,667 INFO L192 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: true [2021-02-22 01:53:36,667 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-22 01:53:36,667 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-22 01:53:36,667 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-22 01:53:36,667 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-22 01:53:36,667 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-22 01:53:36,667 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-22 01:53:36,668 INFO L192 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-02-22 01:53:36,668 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2021-02-22 01:53:36,669 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-22 01:53:36,669 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-22 01:53:36,670 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-22 01:53:36,670 INFO L192 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: true [2021-02-22 01:53:36,670 INFO L192 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: true [2021-02-22 01:53:36,670 INFO L192 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: true [2021-02-22 01:53:36,671 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-22 01:53:36,671 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-22 01:53:36,671 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-22 01:53:36,671 INFO L192 CegarLoopUtils]: At program point L119(lines 7 123) the Hoare annotation is: true [2021-02-22 01:53:36,671 INFO L192 CegarLoopUtils]: At program point L53(lines 53 55) the Hoare annotation is: true [2021-02-22 01:53:36,671 INFO L192 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-02-22 01:53:36,672 INFO L192 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: true [2021-02-22 01:53:36,672 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-22 01:53:36,672 INFO L192 CegarLoopUtils]: At program point L20-2(line 20) the Hoare annotation is: true [2021-02-22 01:53:36,672 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-22 01:53:36,673 INFO L192 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: true [2021-02-22 01:53:36,673 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-22 01:53:36,673 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-22 01:53:36,673 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-22 01:53:36,673 INFO L192 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: true [2021-02-22 01:53:36,673 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-22 01:53:36,674 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-22 01:53:36,674 INFO L192 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: true [2021-02-22 01:53:36,674 INFO L192 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-02-22 01:53:36,674 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2021-02-22 01:53:36,674 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-22 01:53:36,674 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2021-02-22 01:53:36,675 INFO L192 CegarLoopUtils]: At program point L30(line 30) the Hoare annotation is: true [2021-02-22 01:53:36,675 INFO L192 CegarLoopUtils]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2021-02-22 01:53:36,675 INFO L185 CegarLoopUtils]: At program point L121(line 121) the Hoare annotation is: false [2021-02-22 01:53:36,675 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-22 01:53:36,675 INFO L192 CegarLoopUtils]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2021-02-22 01:53:36,675 INFO L192 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: true [2021-02-22 01:53:36,676 INFO L192 CegarLoopUtils]: At program point L14(line 14) the Hoare annotation is: true [2021-02-22 01:53:36,676 INFO L192 CegarLoopUtils]: At program point L14-1(line 14) the Hoare annotation is: true [2021-02-22 01:53:36,676 INFO L192 CegarLoopUtils]: At program point L14-2(line 14) the Hoare annotation is: true [2021-02-22 01:53:36,676 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-22 01:53:36,676 INFO L192 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: true [2021-02-22 01:53:36,676 INFO L185 CegarLoopUtils]: At program point L122(line 122) the Hoare annotation is: false [2021-02-22 01:53:36,677 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-22 01:53:36,677 INFO L192 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: true [2021-02-22 01:53:36,677 INFO L192 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: true [2021-02-22 01:53:36,677 INFO L192 CegarLoopUtils]: At program point L23-2(line 23) the Hoare annotation is: true [2021-02-22 01:53:36,677 INFO L185 CegarLoopUtils]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-22 01:53:36,677 INFO L185 CegarLoopUtils]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2021-02-22 01:53:36,677 INFO L192 CegarLoopUtils]: At program point L15(line 15) the Hoare annotation is: true [2021-02-22 01:53:36,678 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-22 01:53:36,678 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-22 01:53:36,679 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-22 01:53:36,679 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-22 01:53:36,679 INFO L192 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: true [2021-02-22 01:53:36,680 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-22 01:53:36,680 INFO L185 CegarLoopUtils]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2021-02-22 01:53:36,680 INFO L192 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: true [2021-02-22 01:53:36,680 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-22 01:53:36,680 INFO L192 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: true [2021-02-22 01:53:36,680 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-22 01:53:36,681 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-22 01:53:36,681 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-22 01:53:36,681 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-22 01:53:36,681 INFO L192 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: true [2021-02-22 01:53:36,681 INFO L192 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: true [2021-02-22 01:53:36,681 INFO L192 CegarLoopUtils]: At program point L33-2(line 33) the Hoare annotation is: true [2021-02-22 01:53:36,681 INFO L185 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2021-02-22 01:53:36,682 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-22 01:53:36,682 INFO L192 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: true [2021-02-22 01:53:36,682 INFO L192 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: true [2021-02-22 01:53:36,683 INFO L192 CegarLoopUtils]: At program point L17-2(line 17) the Hoare annotation is: true [2021-02-22 01:53:36,683 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-22 01:53:36,683 INFO L192 CegarLoopUtils]: At program point L9(line 9) the Hoare annotation is: true [2021-02-22 01:53:36,683 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-22 01:53:36,683 INFO L192 CegarLoopUtils]: At program point L34(lines 34 36) the Hoare annotation is: true [2021-02-22 01:53:36,683 INFO L192 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: true [2021-02-22 01:53:36,683 INFO L192 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: true [2021-02-22 01:53:36,683 INFO L192 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: true [2021-02-22 01:53:36,684 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-22 01:53:36,684 INFO L192 CegarLoopUtils]: At program point L18(line 18) the Hoare annotation is: true [2021-02-22 01:53:36,685 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-22 01:53:36,685 INFO L192 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: true [2021-02-22 01:53:36,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.02 01:53:36 BoogieIcfgContainer [2021-02-22 01:53:36,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-22 01:53:36,699 INFO L168 Benchmark]: Toolchain (without parser) took 50893.98 ms. Allocated memory was 155.2 MB in the beginning and 1.1 GB in the end (delta: 902.8 MB). Free memory was 130.8 MB in the beginning and 774.3 MB in the end (delta: -643.5 MB). Peak memory consumption was 659.6 MB. Max. memory is 8.0 GB. [2021-02-22 01:53:36,700 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 155.2 MB. Free memory is still 140.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-22 01:53:36,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.32 ms. Allocated memory is still 155.2 MB. Free memory was 129.7 MB in the beginning and 119.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-22 01:53:36,700 INFO L168 Benchmark]: Boogie Preprocessor took 41.60 ms. Allocated memory is still 155.2 MB. Free memory was 119.7 MB in the beginning and 118.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-22 01:53:36,701 INFO L168 Benchmark]: RCFGBuilder took 716.19 ms. Allocated memory is still 155.2 MB. Free memory was 118.0 MB in the beginning and 122.9 MB in the end (delta: -4.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 8.0 GB. [2021-02-22 01:53:36,701 INFO L168 Benchmark]: TraceAbstraction took 49816.93 ms. Allocated memory was 155.2 MB in the beginning and 1.1 GB in the end (delta: 902.8 MB). Free memory was 122.2 MB in the beginning and 774.3 MB in the end (delta: -652.1 MB). Peak memory consumption was 651.3 MB. Max. memory is 8.0 GB. [2021-02-22 01:53:36,703 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.23 ms. Allocated memory is still 155.2 MB. Free memory is still 140.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 293.32 ms. Allocated memory is still 155.2 MB. Free memory was 129.7 MB in the beginning and 119.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.60 ms. Allocated memory is still 155.2 MB. Free memory was 119.7 MB in the beginning and 118.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 716.19 ms. Allocated memory is still 155.2 MB. Free memory was 118.0 MB in the beginning and 122.9 MB in the end (delta: -4.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49816.93 ms. Allocated memory was 155.2 MB in the beginning and 1.1 GB in the end (delta: 902.8 MB). Free memory was 122.2 MB in the beginning and 774.3 MB in the end (delta: -652.1 MB). Peak memory consumption was 651.3 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: 10.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1927 SDtfs, 2229 SDslu, 214 SDs, 0 SdLazy, 1391 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s 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.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1020 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 97 LocationsWithAnnotation, 97 PreInvPairs, 4777 NumberOfFragments, 13957 HoareAnnotationTreeSize, 97 FomulaSimplifications, 1335593 FormulaSimplificationTreeSizeReduction, 8.9s HoareSimplificationTime, 97 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 30.3s 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...