/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:41:16,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:41:16,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:41:16,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:41:16,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:41:16,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:41:16,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:41:16,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:41:16,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:41:16,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:41:16,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:41:16,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:41:16,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:41:16,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:41:16,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:41:16,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:41:16,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:41:16,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:41:16,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:41:16,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:41:16,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:41:16,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:41:16,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:41:16,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:41:16,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:41:16,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:41:16,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:41:16,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:41:16,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:41:16,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:41:16,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:41:16,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:41:16,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:41:16,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:41:16,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:41:16,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:41:16,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:41:16,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:41:16,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:41:16,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:41:16,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:41:16,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:41:17,027 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:41:17,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:41:17,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:41:17,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:41:17,031 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:41:17,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:41:17,032 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:41:17,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:41:17,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:41:17,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:41:17,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:41:17,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:41:17,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:41:17,033 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:41:17,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:41:17,033 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:41:17,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:41:17,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:41:17,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:41:17,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:41:17,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:41:17,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:41:17,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:41:17,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:41:17,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:41:17,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:41:17,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:41:17,037 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:41:17,037 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:41:17,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:41:17,038 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:41:17,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:41:17,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:41:17,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:41:17,364 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:41:17,366 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:41:17,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2020-10-22 00:41:17,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15debe5b/377f667eb8a14f299b97529c61047dcc/FLAGd214a5262 [2020-10-22 00:41:18,024 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:41:18,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2020-10-22 00:41:18,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15debe5b/377f667eb8a14f299b97529c61047dcc/FLAGd214a5262 [2020-10-22 00:41:18,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15debe5b/377f667eb8a14f299b97529c61047dcc [2020-10-22 00:41:18,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:41:18,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:41:18,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:41:18,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:41:18,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:41:18,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:41:18" (1/1) ... [2020-10-22 00:41:18,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66705fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:18, skipping insertion in model container [2020-10-22 00:41:18,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:41:18" (1/1) ... [2020-10-22 00:41:18,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:41:18,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:41:18,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:41:19,001 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:41:19,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:41:19,166 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:41:19,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19 WrapperNode [2020-10-22 00:41:19,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:41:19,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:41:19,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:41:19,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:41:19,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:41:19,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:41:19,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:41:19,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:41:19,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... [2020-10-22 00:41:19,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:41:19,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:41:19,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:41:19,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:41:19,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:41:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:41:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:41:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:41:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:41:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:41:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:41:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:41:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:41:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:41:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:41:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:41:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:41:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:41:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:41:19,354 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:41:21,426 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:41:21,426 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:41:21,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:41:21 BoogieIcfgContainer [2020-10-22 00:41:21,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:41:21,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:41:21,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:41:21,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:41:21,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:41:18" (1/3) ... [2020-10-22 00:41:21,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54542799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:41:21, skipping insertion in model container [2020-10-22 00:41:21,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:19" (2/3) ... [2020-10-22 00:41:21,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54542799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:41:21, skipping insertion in model container [2020-10-22 00:41:21,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:41:21" (3/3) ... [2020-10-22 00:41:21,439 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.oepc.i [2020-10-22 00:41:21,453 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:41:21,453 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:41:21,462 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:41:21,463 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:41:21,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,502 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,502 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,505 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,505 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,516 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,516 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,523 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,523 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:21,531 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:41:21,545 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:41:21,568 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:41:21,568 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:41:21,568 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:41:21,568 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:41:21,568 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:41:21,569 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:41:21,569 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:41:21,569 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:41:21,589 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:41:21,590 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:21,593 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:21,595 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:21,655 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-22 00:41:21,656 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:41:21,661 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 00:41:21,665 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-22 00:41:22,154 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-22 00:41:23,504 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-22 00:41:23,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-22 00:41:23,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:41:23,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-22 00:41:23,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:41:24,566 WARN L193 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-22 00:41:25,151 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 00:41:25,636 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-22 00:41:25,909 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-22 00:41:26,400 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-10-22 00:41:26,572 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-22 00:41:26,584 INFO L131 LiptonReduction]: Checked pairs total: 5192 [2020-10-22 00:41:26,584 INFO L133 LiptonReduction]: Total number of compositions: 87 [2020-10-22 00:41:26,592 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-22 00:41:26,657 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-22 00:41:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-22 00:41:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:41:26,670 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:26,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:41:26,672 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1086473, now seen corresponding path program 1 times [2020-10-22 00:41:26,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:26,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228024440] [2020-10-22 00:41:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:26,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228024440] [2020-10-22 00:41:26,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:26,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:41:26,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607120484] [2020-10-22 00:41:26,914 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:26,918 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:26,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:41:26,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:26,935 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:26,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:41:26,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:41:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:26,954 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-22 00:41:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:27,070 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-22 00:41:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:27,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:41:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:27,096 INFO L225 Difference]: With dead ends: 812 [2020-10-22 00:41:27,097 INFO L226 Difference]: Without dead ends: 687 [2020-10-22 00:41:27,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-22 00:41:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-22 00:41:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-22 00:41:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-22 00:41:27,227 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-22 00:41:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:27,227 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-22 00:41:27,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:41:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-22 00:41:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:41:27,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:27,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:27,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:41:27,234 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash -622279271, now seen corresponding path program 1 times [2020-10-22 00:41:27,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:27,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677502513] [2020-10-22 00:41:27,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:27,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677502513] [2020-10-22 00:41:27,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:27,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:27,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693017606] [2020-10-22 00:41:27,428 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:27,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:27,432 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:41:27,432 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:27,433 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:27,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:27,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:27,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:27,435 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 5 states. [2020-10-22 00:41:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:27,553 INFO L93 Difference]: Finished difference Result 808 states and 2436 transitions. [2020-10-22 00:41:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:41:27,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-22 00:41:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:27,561 INFO L225 Difference]: With dead ends: 808 [2020-10-22 00:41:27,561 INFO L226 Difference]: Without dead ends: 683 [2020-10-22 00:41:27,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:41:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-10-22 00:41:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2020-10-22 00:41:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2020-10-22 00:41:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 2134 transitions. [2020-10-22 00:41:27,590 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 2134 transitions. Word has length 10 [2020-10-22 00:41:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:27,591 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 2134 transitions. [2020-10-22 00:41:27,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 2134 transitions. [2020-10-22 00:41:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:27,593 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:27,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:27,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:41:27,594 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:27,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1985552932, now seen corresponding path program 1 times [2020-10-22 00:41:27,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:27,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387948619] [2020-10-22 00:41:27,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:27,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387948619] [2020-10-22 00:41:27,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:27,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:41:27,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237961647] [2020-10-22 00:41:27,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:27,711 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:27,714 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions. [2020-10-22 00:41:27,714 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:27,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:27,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:27,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:27,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:27,888 INFO L87 Difference]: Start difference. First operand 683 states and 2134 transitions. Second operand 4 states. [2020-10-22 00:41:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:27,936 INFO L93 Difference]: Finished difference Result 767 states and 2317 transitions. [2020-10-22 00:41:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:41:27,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:41:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:27,942 INFO L225 Difference]: With dead ends: 767 [2020-10-22 00:41:27,942 INFO L226 Difference]: Without dead ends: 667 [2020-10-22 00:41:27,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-10-22 00:41:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2020-10-22 00:41:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-10-22 00:41:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-10-22 00:41:27,968 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 11 [2020-10-22 00:41:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:27,969 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-10-22 00:41:27,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-10-22 00:41:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:27,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:27,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:27,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:41:27,972 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2110791846, now seen corresponding path program 1 times [2020-10-22 00:41:27,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:27,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429485489] [2020-10-22 00:41:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:28,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429485489] [2020-10-22 00:41:28,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:28,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:28,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1928713841] [2020-10-22 00:41:28,152 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:28,154 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:28,155 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 15 transitions. [2020-10-22 00:41:28,156 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:28,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 00:41:28,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:28,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 00:41:28,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:28,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:28,184 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:28,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:28,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:28,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:28,226 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:28,242 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:28,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:28,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:28,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:28,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:28,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:28,296 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 5 states. [2020-10-22 00:41:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:28,482 INFO L93 Difference]: Finished difference Result 750 states and 2238 transitions. [2020-10-22 00:41:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:41:28,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-22 00:41:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:28,488 INFO L225 Difference]: With dead ends: 750 [2020-10-22 00:41:28,488 INFO L226 Difference]: Without dead ends: 635 [2020-10-22 00:41:28,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-10-22 00:41:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2020-10-22 00:41:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2020-10-22 00:41:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1950 transitions. [2020-10-22 00:41:28,515 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1950 transitions. Word has length 11 [2020-10-22 00:41:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:28,515 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 1950 transitions. [2020-10-22 00:41:28,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1950 transitions. [2020-10-22 00:41:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:41:28,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:28,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:28,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:41:28,521 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:28,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:28,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1010089465, now seen corresponding path program 1 times [2020-10-22 00:41:28,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:28,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279122249] [2020-10-22 00:41:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:28,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279122249] [2020-10-22 00:41:28,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:28,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:41:28,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [959331555] [2020-10-22 00:41:28,653 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:28,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:28,656 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 16 transitions. [2020-10-22 00:41:28,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:28,675 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:28,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:28,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:28,692 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:28,698 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:41:28,701 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:28,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:28,713 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:28,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:28,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:28,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:28,745 INFO L87 Difference]: Start difference. First operand 635 states and 1950 transitions. Second operand 4 states. [2020-10-22 00:41:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:28,820 INFO L93 Difference]: Finished difference Result 704 states and 2101 transitions. [2020-10-22 00:41:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:41:28,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 00:41:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:28,826 INFO L225 Difference]: With dead ends: 704 [2020-10-22 00:41:28,826 INFO L226 Difference]: Without dead ends: 629 [2020-10-22 00:41:28,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-10-22 00:41:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2020-10-22 00:41:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-10-22 00:41:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1928 transitions. [2020-10-22 00:41:28,847 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1928 transitions. Word has length 12 [2020-10-22 00:41:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:28,847 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1928 transitions. [2020-10-22 00:41:28,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1928 transitions. [2020-10-22 00:41:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:41:28,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:28,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:28,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:41:28,849 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1151052406, now seen corresponding path program 1 times [2020-10-22 00:41:28,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:28,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255425805] [2020-10-22 00:41:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:28,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255425805] [2020-10-22 00:41:28,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:28,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:28,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115100744] [2020-10-22 00:41:28,998 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:29,000 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:29,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-10-22 00:41:29,004 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:29,023 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:29,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:29,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:29,040 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:29,044 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:41:29,046 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:29,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:29,057 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:29,288 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12537#(and (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff0~0 2)) (= ~z$w_buff0~0 ~x~0))] [2020-10-22 00:41:29,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:41:29,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:29,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:41:29,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:41:29,289 INFO L87 Difference]: Start difference. First operand 629 states and 1928 transitions. Second operand 6 states. [2020-10-22 00:41:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:29,420 INFO L93 Difference]: Finished difference Result 683 states and 2042 transitions. [2020-10-22 00:41:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:41:29,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 00:41:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:29,427 INFO L225 Difference]: With dead ends: 683 [2020-10-22 00:41:29,427 INFO L226 Difference]: Without dead ends: 623 [2020-10-22 00:41:29,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-10-22 00:41:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2020-10-22 00:41:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2020-10-22 00:41:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1906 transitions. [2020-10-22 00:41:29,448 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1906 transitions. Word has length 13 [2020-10-22 00:41:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:29,449 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 1906 transitions. [2020-10-22 00:41:29,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:41:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1906 transitions. [2020-10-22 00:41:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:41:29,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:29,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:29,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:41:29,451 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1698263793, now seen corresponding path program 1 times [2020-10-22 00:41:29,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:29,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795384388] [2020-10-22 00:41:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:29,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795384388] [2020-10-22 00:41:29,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:29,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:41:29,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963771600] [2020-10-22 00:41:29,554 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:29,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:29,559 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 35 transitions. [2020-10-22 00:41:29,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:29,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 00:41:29,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:29,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:29,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14477#(or (= ~z$w_buff0_used~0 0) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd0~0 256) 0))))] [2020-10-22 00:41:29,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:41:29,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:29,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:41:29,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:29,811 INFO L87 Difference]: Start difference. First operand 623 states and 1906 transitions. Second operand 7 states. [2020-10-22 00:41:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:29,986 INFO L93 Difference]: Finished difference Result 694 states and 2076 transitions. [2020-10-22 00:41:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:41:29,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-22 00:41:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:29,992 INFO L225 Difference]: With dead ends: 694 [2020-10-22 00:41:29,992 INFO L226 Difference]: Without dead ends: 632 [2020-10-22 00:41:29,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:41:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-10-22 00:41:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2020-10-22 00:41:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-10-22 00:41:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1920 transitions. [2020-10-22 00:41:30,014 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1920 transitions. Word has length 13 [2020-10-22 00:41:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:30,014 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 1920 transitions. [2020-10-22 00:41:30,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:41:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1920 transitions. [2020-10-22 00:41:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:41:30,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:30,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:30,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:41:30,016 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1676525973, now seen corresponding path program 2 times [2020-10-22 00:41:30,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:30,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126808868] [2020-10-22 00:41:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:30,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126808868] [2020-10-22 00:41:30,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:30,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:30,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041611856] [2020-10-22 00:41:30,115 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:30,117 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:30,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 35 transitions. [2020-10-22 00:41:30,120 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:30,362 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:30,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:30,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:30,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:30,364 INFO L87 Difference]: Start difference. First operand 628 states and 1920 transitions. Second operand 5 states. [2020-10-22 00:41:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:30,475 INFO L93 Difference]: Finished difference Result 775 states and 2305 transitions. [2020-10-22 00:41:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:41:30,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:41:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:30,481 INFO L225 Difference]: With dead ends: 775 [2020-10-22 00:41:30,482 INFO L226 Difference]: Without dead ends: 690 [2020-10-22 00:41:30,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2020-10-22 00:41:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 657. [2020-10-22 00:41:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2020-10-22 00:41:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1996 transitions. [2020-10-22 00:41:30,502 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1996 transitions. Word has length 13 [2020-10-22 00:41:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:30,502 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 1996 transitions. [2020-10-22 00:41:30,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1996 transitions. [2020-10-22 00:41:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:41:30,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:30,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:30,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:41:30,505 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash -505215711, now seen corresponding path program 1 times [2020-10-22 00:41:30,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:30,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517462411] [2020-10-22 00:41:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:30,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517462411] [2020-10-22 00:41:30,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:30,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:30,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [18694943] [2020-10-22 00:41:30,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:30,578 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:30,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 64 transitions. [2020-10-22 00:41:30,586 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:30,793 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:30,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:30,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:30,794 INFO L87 Difference]: Start difference. First operand 657 states and 1996 transitions. Second operand 4 states. [2020-10-22 00:41:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:30,826 INFO L93 Difference]: Finished difference Result 1039 states and 3046 transitions. [2020-10-22 00:41:30,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:41:30,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 00:41:30,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:30,832 INFO L225 Difference]: With dead ends: 1039 [2020-10-22 00:41:30,832 INFO L226 Difference]: Without dead ends: 721 [2020-10-22 00:41:30,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-10-22 00:41:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 637. [2020-10-22 00:41:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-10-22 00:41:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1864 transitions. [2020-10-22 00:41:30,851 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1864 transitions. Word has length 14 [2020-10-22 00:41:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:30,852 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 1864 transitions. [2020-10-22 00:41:30,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1864 transitions. [2020-10-22 00:41:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:41:30,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:30,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:30,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:41:30,854 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1380566184, now seen corresponding path program 1 times [2020-10-22 00:41:30,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:30,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302312998] [2020-10-22 00:41:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:30,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302312998] [2020-10-22 00:41:30,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:30,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:41:30,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894483056] [2020-10-22 00:41:30,942 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:30,944 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:30,951 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2020-10-22 00:41:30,951 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:30,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:30,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:30,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:30,987 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:30,990 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:41:30,992 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:31,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,002 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:31,347 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:31,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:41:31,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:31,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:41:31,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:41:31,349 INFO L87 Difference]: Start difference. First operand 637 states and 1864 transitions. Second operand 6 states. [2020-10-22 00:41:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:31,409 INFO L93 Difference]: Finished difference Result 1017 states and 2853 transitions. [2020-10-22 00:41:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:41:31,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-22 00:41:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:31,414 INFO L225 Difference]: With dead ends: 1017 [2020-10-22 00:41:31,414 INFO L226 Difference]: Without dead ends: 689 [2020-10-22 00:41:31,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2020-10-22 00:41:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 617. [2020-10-22 00:41:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2020-10-22 00:41:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1724 transitions. [2020-10-22 00:41:31,431 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1724 transitions. Word has length 14 [2020-10-22 00:41:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:31,432 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 1724 transitions. [2020-10-22 00:41:31,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:41:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1724 transitions. [2020-10-22 00:41:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:41:31,433 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:31,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:31,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:41:31,434 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1106519313, now seen corresponding path program 1 times [2020-10-22 00:41:31,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:31,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546291534] [2020-10-22 00:41:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:31,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546291534] [2020-10-22 00:41:31,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:31,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:41:31,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1177037379] [2020-10-22 00:41:31,667 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:31,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:31,673 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 38 transitions. [2020-10-22 00:41:31,674 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:31,808 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2020-10-22 00:41:31,821 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:31,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:41:31,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,830 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:31,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,833 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:41:31,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:31,872 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:41:31,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:31,883 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:31,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,885 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:31,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:31,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:31,907 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:31,909 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:31,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,912 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:31,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,919 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:31,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:31,953 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:41:31,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:31,958 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:31,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:31,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,038 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:32,039 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,088 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,175 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,245 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:32,322 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:41:32,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,326 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,383 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,387 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:32,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:32,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:32,485 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,488 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:32,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,509 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 6 conjuncts [2020-10-22 00:41:32,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,512 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:41:32,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,520 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:41:32,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,577 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,594 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,608 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:32,625 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,632 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:32,679 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:32,685 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:32,694 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:32,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:32,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,804 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,823 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:32,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,987 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:32,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:32,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,000 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:33,003 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:41:33,005 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:33,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,015 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,282 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:33,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:41:33,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:33,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:41:33,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:41:33,284 INFO L87 Difference]: Start difference. First operand 617 states and 1724 transitions. Second operand 6 states. [2020-10-22 00:41:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:33,436 INFO L93 Difference]: Finished difference Result 829 states and 2214 transitions. [2020-10-22 00:41:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:41:33,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-22 00:41:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:33,441 INFO L225 Difference]: With dead ends: 829 [2020-10-22 00:41:33,441 INFO L226 Difference]: Without dead ends: 629 [2020-10-22 00:41:33,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-10-22 00:41:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 557. [2020-10-22 00:41:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-22 00:41:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1496 transitions. [2020-10-22 00:41:33,456 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1496 transitions. Word has length 14 [2020-10-22 00:41:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:33,456 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1496 transitions. [2020-10-22 00:41:33,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:41:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1496 transitions. [2020-10-22 00:41:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:41:33,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:33,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:33,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:41:33,459 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1518178514, now seen corresponding path program 1 times [2020-10-22 00:41:33,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:33,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465209410] [2020-10-22 00:41:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:33,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465209410] [2020-10-22 00:41:33,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:33,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:41:33,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150145433] [2020-10-22 00:41:33,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:33,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:33,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 99 transitions. [2020-10-22 00:41:33,607 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:33,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 00:41:33,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 00:41:33,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:33,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,637 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-22 00:41:33,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 00:41:33,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:33,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,682 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:33,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,693 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,711 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,725 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,759 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 6 conjuncts [2020-10-22 00:41:33,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,791 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 00:41:33,792 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 00:41:33,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,817 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 00:41:33,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 00:41:33,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:33,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,844 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,852 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:33,859 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,865 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,875 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:33,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:33,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:33,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,097 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2020-10-22 00:41:34,111 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-22 00:41:34,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,113 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-22 00:41:34,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,114 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:41:34,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,115 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:34,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:34,127 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:41:34,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:34,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:34,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:34,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,267 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:34,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,353 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:41:34,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,355 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:34,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,503 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 4 conjuncts [2020-10-22 00:41:34,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,510 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:34,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,515 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:34,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:34,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:34,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,703 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:41:34,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,783 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 00:41:34,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,786 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:34,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,846 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:34,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,867 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:34,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,884 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:34,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,926 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:34,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:34,966 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:34,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:34,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,008 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:41:35,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,349 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2020-10-22 00:41:35,357 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-22 00:41:35,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,360 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 00:41:35,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:35,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,377 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:35,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,396 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:35,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,401 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:35,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,429 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 00:41:35,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,521 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:35,524 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:35,532 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:35,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,539 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:41:35,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:35,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,654 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:41:35,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:35,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:41:35,703 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:35,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,771 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 00:41:35,775 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:35,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,818 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:35,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,836 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:35,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,869 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:35,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,899 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:35,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,931 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:35,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:35,959 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:41:35,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:35,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,252 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2020-10-22 00:41:36,258 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-22 00:41:36,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,260 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-22 00:41:36,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,261 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:36,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,270 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:41:36,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,272 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:41:36,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,303 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:36,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,493 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:36,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,540 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:41:36,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,653 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:36,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:36,677 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:36,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,681 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:36,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,748 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:36,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,767 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:41:36,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,778 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 00:41:36,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:36,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:41:36,791 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:41:37,944 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [25073#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (or (= (mod ~z$w_buff1_used~0 256) 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0))) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0) (= (mod ~z$r_buff0_thd2~0 256) 0)), 25074#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0) (= (mod ~z$r_buff0_thd2~0 256) 0)), 25075#(and (= ~z$r_buff0_thd0~0 0) (not (= 2 ~z~0)) (= (mod ~z$r_buff0_thd2~0 256) 0)), 25076#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 ~z~0) (not (= 2 ~z~0)) (= (mod ~z$r_buff0_thd2~0 256) 0)), 25077#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd2~0 0) (not (= 2 ~z~0)))] [2020-10-22 00:41:37,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:41:37,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:37,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:41:37,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:41:37,945 INFO L87 Difference]: Start difference. First operand 557 states and 1496 transitions. Second operand 12 states. [2020-10-22 00:41:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:38,186 INFO L93 Difference]: Finished difference Result 635 states and 1666 transitions. [2020-10-22 00:41:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 00:41:38,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-22 00:41:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:38,191 INFO L225 Difference]: With dead ends: 635 [2020-10-22 00:41:38,191 INFO L226 Difference]: Without dead ends: 587 [2020-10-22 00:41:38,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:41:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-10-22 00:41:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 579. [2020-10-22 00:41:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-10-22 00:41:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1541 transitions. [2020-10-22 00:41:38,205 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1541 transitions. Word has length 15 [2020-10-22 00:41:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:38,205 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 1541 transitions. [2020-10-22 00:41:38,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:41:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1541 transitions. [2020-10-22 00:41:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:41:38,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:38,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:38,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:41:38,207 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash 151163354, now seen corresponding path program 1 times [2020-10-22 00:41:38,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:38,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16464637] [2020-10-22 00:41:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:38,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16464637] [2020-10-22 00:41:38,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:38,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:38,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406310488] [2020-10-22 00:41:38,266 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:38,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:38,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 112 transitions. [2020-10-22 00:41:38,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:38,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:38,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:38,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:38,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:38,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:38,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26879#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 00:41:38,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:38,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:38,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:38,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:38,821 INFO L87 Difference]: Start difference. First operand 579 states and 1541 transitions. Second operand 5 states. [2020-10-22 00:41:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:38,892 INFO L93 Difference]: Finished difference Result 376 states and 860 transitions. [2020-10-22 00:41:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:41:38,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 00:41:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:38,895 INFO L225 Difference]: With dead ends: 376 [2020-10-22 00:41:38,895 INFO L226 Difference]: Without dead ends: 225 [2020-10-22 00:41:38,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-22 00:41:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2020-10-22 00:41:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-22 00:41:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 444 transitions. [2020-10-22 00:41:38,903 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 444 transitions. Word has length 15 [2020-10-22 00:41:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:38,903 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 444 transitions. [2020-10-22 00:41:38,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 444 transitions. [2020-10-22 00:41:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:41:38,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:38,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:38,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:41:38,905 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:38,906 INFO L82 PathProgramCache]: Analyzing trace with hash -229010692, now seen corresponding path program 1 times [2020-10-22 00:41:38,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:38,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306004017] [2020-10-22 00:41:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:39,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306004017] [2020-10-22 00:41:39,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:39,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:41:39,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [245179571] [2020-10-22 00:41:39,251 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:39,254 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:39,261 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2020-10-22 00:41:39,262 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:39,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:39,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:41:39,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:41:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:39,514 INFO L87 Difference]: Start difference. First operand 223 states and 444 transitions. Second operand 8 states. [2020-10-22 00:41:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:39,631 INFO L93 Difference]: Finished difference Result 226 states and 445 transitions. [2020-10-22 00:41:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:41:39,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-22 00:41:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:39,633 INFO L225 Difference]: With dead ends: 226 [2020-10-22 00:41:39,633 INFO L226 Difference]: Without dead ends: 221 [2020-10-22 00:41:39,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:41:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-22 00:41:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-10-22 00:41:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-22 00:41:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 440 transitions. [2020-10-22 00:41:39,639 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 440 transitions. Word has length 18 [2020-10-22 00:41:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:39,639 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 440 transitions. [2020-10-22 00:41:39,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:41:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 440 transitions. [2020-10-22 00:41:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:41:39,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:39,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:39,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:41:39,641 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash 996718655, now seen corresponding path program 1 times [2020-10-22 00:41:39,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:39,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086658805] [2020-10-22 00:41:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:39,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086658805] [2020-10-22 00:41:39,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:39,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:41:39,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850764968] [2020-10-22 00:41:39,830 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:39,834 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:39,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 71 transitions. [2020-10-22 00:41:39,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:40,397 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [28393#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (not (= 2 ~z~0)))] [2020-10-22 00:41:40,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 00:41:40,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 00:41:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:41:40,398 INFO L87 Difference]: Start difference. First operand 221 states and 440 transitions. Second operand 10 states. [2020-10-22 00:41:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:40,707 INFO L93 Difference]: Finished difference Result 274 states and 521 transitions. [2020-10-22 00:41:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 00:41:40,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-10-22 00:41:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:40,709 INFO L225 Difference]: With dead ends: 274 [2020-10-22 00:41:40,709 INFO L226 Difference]: Without dead ends: 217 [2020-10-22 00:41:40,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:41:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-10-22 00:41:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2020-10-22 00:41:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-10-22 00:41:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 381 transitions. [2020-10-22 00:41:40,715 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 381 transitions. Word has length 19 [2020-10-22 00:41:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:40,715 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 381 transitions. [2020-10-22 00:41:40,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 00:41:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 381 transitions. [2020-10-22 00:41:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:41:40,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:40,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:40,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 00:41:40,716 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 354604781, now seen corresponding path program 1 times [2020-10-22 00:41:40,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:40,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767007088] [2020-10-22 00:41:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:40,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767007088] [2020-10-22 00:41:40,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:40,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:41:40,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029808424] [2020-10-22 00:41:40,826 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:40,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:40,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 137 transitions. [2020-10-22 00:41:40,849 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:41,492 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [29076#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:41:41,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:41:41,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:41:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:41,494 INFO L87 Difference]: Start difference. First operand 197 states and 381 transitions. Second operand 7 states. [2020-10-22 00:41:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:41,548 INFO L93 Difference]: Finished difference Result 168 states and 325 transitions. [2020-10-22 00:41:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:41:41,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:41:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:41,549 INFO L225 Difference]: With dead ends: 168 [2020-10-22 00:41:41,549 INFO L226 Difference]: Without dead ends: 63 [2020-10-22 00:41:41,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-22 00:41:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-22 00:41:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-22 00:41:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-22 00:41:41,553 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-22 00:41:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:41,553 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-22 00:41:41,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:41:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-22 00:41:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:41:41,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:41,554 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] [2020-10-22 00:41:41,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 00:41:41,555 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash -222298438, now seen corresponding path program 1 times [2020-10-22 00:41:41,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:41,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887550204] [2020-10-22 00:41:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:41:41,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:41:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:41:41,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:41:41,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:41:41,720 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:41:41,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 00:41:41,743 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,743 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-10-22 00:41:41,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,755 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,756 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,758 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,759 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,763 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,764 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,765 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,766 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,767 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,768 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:41,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:41,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:41:41 BasicIcfg [2020-10-22 00:41:41,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:41:41,874 INFO L168 Benchmark]: Toolchain (without parser) took 23575.37 ms. Allocated memory was 138.9 MB in the beginning and 578.3 MB in the end (delta: 439.4 MB). Free memory was 99.4 MB in the beginning and 372.1 MB in the end (delta: -272.6 MB). Peak memory consumption was 166.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:41,875 INFO L168 Benchmark]: CDTParser took 3.16 ms. Allocated memory is still 138.9 MB. Free memory was 119.4 MB in the beginning and 118.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:41:41,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.15 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 98.2 MB in the beginning and 151.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:41,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.94 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 148.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:41,880 INFO L168 Benchmark]: Boogie Preprocessor took 42.95 ms. Allocated memory is still 201.9 MB. Free memory was 148.5 MB in the beginning and 146.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:41,881 INFO L168 Benchmark]: RCFGBuilder took 2149.88 ms. Allocated memory was 201.9 MB in the beginning and 253.8 MB in the end (delta: 51.9 MB). Free memory was 146.5 MB in the beginning and 170.6 MB in the end (delta: -24.1 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:41,882 INFO L168 Benchmark]: TraceAbstraction took 20439.82 ms. Allocated memory was 253.8 MB in the beginning and 578.3 MB in the end (delta: 324.5 MB). Free memory was 170.6 MB in the beginning and 372.1 MB in the end (delta: -201.5 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:41,887 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.16 ms. Allocated memory is still 138.9 MB. Free memory was 119.4 MB in the beginning and 118.9 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 865.15 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 98.2 MB in the beginning and 151.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.94 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 148.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.95 ms. Allocated memory is still 201.9 MB. Free memory was 148.5 MB in the beginning and 146.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2149.88 ms. Allocated memory was 201.9 MB in the beginning and 253.8 MB in the end (delta: 51.9 MB). Free memory was 146.5 MB in the beginning and 170.6 MB in the end (delta: -24.1 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20439.82 ms. Allocated memory was 253.8 MB in the beginning and 578.3 MB in the end (delta: 324.5 MB). Free memory was 170.6 MB in the beginning and 372.1 MB in the end (delta: -201.5 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 919 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 60 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.9s, 107 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 5192 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2501; [L817] FCALL, FORK 0 pthread_create(&t2501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2502; [L819] FCALL, FORK 0 pthread_create(&t2502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2503; [L821] FCALL, FORK 0 pthread_create(&t2503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 473 SDtfs, 493 SDslu, 1013 SDs, 0 SdLazy, 604 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 182 SyntacticMatches, 14 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 295 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 34425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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 incorrect! Received shutdown request...