/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/safe024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:43:56,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:43:56,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:43:56,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:43:56,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:43:56,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:43:56,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:43:56,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:43:56,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:43:56,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:43:56,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:43:56,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:43:56,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:43:56,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:43:56,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:43:56,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:43:56,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:43:56,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:43:56,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:43:56,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:43:56,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:43:56,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:43:56,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:43:56,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:43:56,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:43:56,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:43:56,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:43:56,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:43:56,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:43:56,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:43:56,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:43:56,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:43:56,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:43:56,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:43:56,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:43:56,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:43:56,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:43:56,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:43:56,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:43:56,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:43:56,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:43:56,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:43:57,025 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:43:57,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:43:57,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:43:57,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:43:57,031 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:43:57,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:43:57,032 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:43:57,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:43:57,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:43:57,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:43:57,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:43:57,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:43:57,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:43:57,033 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:43:57,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:43:57,033 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:43:57,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:43:57,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:43:57,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:43:57,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:43:57,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:43:57,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:43:57,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:43:57,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:43:57,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:43:57,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:43:57,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:43:57,037 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:43:57,038 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:43:57,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:43:57,038 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:43:57,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:43:57,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:43:57,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:43:57,367 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:43:57,367 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:43:57,368 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2020-10-16 13:43:57,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8409bd6f2/2a33bb4ccbb64f199df121f25c855534/FLAGfb717d262 [2020-10-16 13:43:58,014 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:43:58,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2020-10-16 13:43:58,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8409bd6f2/2a33bb4ccbb64f199df121f25c855534/FLAGfb717d262 [2020-10-16 13:43:58,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8409bd6f2/2a33bb4ccbb64f199df121f25c855534 [2020-10-16 13:43:58,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:43:58,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:43:58,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:43:58,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:43:58,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:43:58,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:43:58" (1/1) ... [2020-10-16 13:43:58,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bcd645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:58, skipping insertion in model container [2020-10-16 13:43:58,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:43:58" (1/1) ... [2020-10-16 13:43:58,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:43:58,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:43:58,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:43:58,959 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:43:59,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:43:59,096 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:43:59,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59 WrapperNode [2020-10-16 13:43:59,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:43:59,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:43:59,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:43:59,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:43:59,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:43:59,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:43:59,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:43:59,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:43:59,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... [2020-10-16 13:43:59,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:43:59,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:43:59,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:43:59,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:43:59,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 13:43:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:43:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:43:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:43:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:43:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:43:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:43:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:43:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:43:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:43:59,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:43:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:43:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:43:59,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:43:59,288 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:44:01,301 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:44:01,301 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:44:01,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:01 BoogieIcfgContainer [2020-10-16 13:44:01,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:44:01,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:44:01,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:44:01,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:44:01,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:43:58" (1/3) ... [2020-10-16 13:44:01,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575ed1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:01, skipping insertion in model container [2020-10-16 13:44:01,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:43:59" (2/3) ... [2020-10-16 13:44:01,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575ed1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:01, skipping insertion in model container [2020-10-16 13:44:01,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:01" (3/3) ... [2020-10-16 13:44:01,311 INFO L111 eAbstractionObserver]: Analyzing ICFG safe024_pso.opt.i [2020-10-16 13:44:01,324 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:44:01,324 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:44:01,333 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:44:01,334 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:44:01,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,385 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,385 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,386 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,397 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,398 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,404 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:44:01,410 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:44:01,424 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:44:01,445 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:44:01,445 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:44:01,445 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:44:01,445 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:44:01,446 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:44:01,446 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:44:01,446 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:44:01,446 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:44:01,460 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:44:01,461 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 13:44:01,463 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 13:44:01,465 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 13:44:01,512 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 13:44:01,513 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:44:01,518 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 13:44:01,521 INFO L117 LiptonReduction]: Number of co-enabled transitions 1544 [2020-10-16 13:44:01,925 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 13:44:02,325 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:44:03,855 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-16 13:44:03,971 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-16 13:44:03,978 INFO L132 LiptonReduction]: Checked pairs total: 3641 [2020-10-16 13:44:03,979 INFO L134 LiptonReduction]: Total number of compositions: 74 [2020-10-16 13:44:03,986 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 13:44:04,031 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states. [2020-10-16 13:44:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states. [2020-10-16 13:44:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 13:44:04,040 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:04,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 13:44:04,041 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash 911998923, now seen corresponding path program 1 times [2020-10-16 13:44:04,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:04,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396057747] [2020-10-16 13:44:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:04,282 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-16 13:44:04,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396057747] [2020-10-16 13:44:04,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:04,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:44:04,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408678709] [2020-10-16 13:44:04,285 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:04,289 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:04,302 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-16 13:44:04,302 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:04,307 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:44:04,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:44:04,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:44:04,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:44:04,325 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states. [2020-10-16 13:44:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:04,444 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 13:44:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:44:04,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 13:44:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:04,467 INFO L225 Difference]: With dead ends: 550 [2020-10-16 13:44:04,468 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 13:44:04,469 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-16 13:44:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 13:44:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 13:44:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 13:44:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 13:44:04,565 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5 [2020-10-16 13:44:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:04,566 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 13:44:04,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:44:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 13:44:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:44:04,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:04,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:44:04,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:44:04,568 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1469007502, now seen corresponding path program 1 times [2020-10-16 13:44:04,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:04,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132398289] [2020-10-16 13:44:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:04,657 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-16 13:44:04,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132398289] [2020-10-16 13:44:04,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:04,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:44:04,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825283372] [2020-10-16 13:44:04,663 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:04,664 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:04,666 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:44:04,666 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:04,666 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:44:04,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:44:04,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:44:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:44:04,669 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 13:44:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:04,681 INFO L93 Difference]: Finished difference Result 430 states and 1287 transitions. [2020-10-16 13:44:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:44:04,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:44:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:04,687 INFO L225 Difference]: With dead ends: 430 [2020-10-16 13:44:04,687 INFO L226 Difference]: Without dead ends: 430 [2020-10-16 13:44:04,688 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-16 13:44:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-10-16 13:44:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2020-10-16 13:44:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-16 13:44:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1287 transitions. [2020-10-16 13:44:04,717 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1287 transitions. Word has length 9 [2020-10-16 13:44:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:04,719 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1287 transitions. [2020-10-16 13:44:04,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:44:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1287 transitions. [2020-10-16 13:44:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:44:04,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:04,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:44:04,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:44:04,721 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:04,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1705388093, now seen corresponding path program 1 times [2020-10-16 13:44:04,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:04,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680382016] [2020-10-16 13:44:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:04,785 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-16 13:44:04,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680382016] [2020-10-16 13:44:04,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:04,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:44:04,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529750540] [2020-10-16 13:44:04,787 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:04,788 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:04,790 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions. [2020-10-16 13:44:04,790 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:04,813 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:44:04,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:44:04,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:44:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:44:04,815 INFO L87 Difference]: Start difference. First operand 430 states and 1287 transitions. Second operand 4 states. [2020-10-16 13:44:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:04,845 INFO L93 Difference]: Finished difference Result 542 states and 1583 transitions. [2020-10-16 13:44:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:44:04,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 13:44:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:04,848 INFO L225 Difference]: With dead ends: 542 [2020-10-16 13:44:04,849 INFO L226 Difference]: Without dead ends: 302 [2020-10-16 13:44:04,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 13:44:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-16 13:44:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2020-10-16 13:44:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-16 13:44:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 847 transitions. [2020-10-16 13:44:04,865 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 847 transitions. Word has length 10 [2020-10-16 13:44:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:04,866 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 847 transitions. [2020-10-16 13:44:04,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:44:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 847 transitions. [2020-10-16 13:44:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:44:04,868 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:04,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:44:04,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:44:04,868 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:04,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1817425920, now seen corresponding path program 1 times [2020-10-16 13:44:04,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:04,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585860454] [2020-10-16 13:44:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:05,030 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-16 13:44:05,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585860454] [2020-10-16 13:44:05,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:05,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:44:05,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492040595] [2020-10-16 13:44:05,031 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:05,033 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:05,037 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions. [2020-10-16 13:44:05,037 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:05,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:05,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:05,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:05,130 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5322#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-16 13:44:05,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:44:05,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:44:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:44:05,131 INFO L87 Difference]: Start difference. First operand 302 states and 847 transitions. Second operand 5 states. [2020-10-16 13:44:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:05,195 INFO L93 Difference]: Finished difference Result 215 states and 525 transitions. [2020-10-16 13:44:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:44:05,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 13:44:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:05,197 INFO L225 Difference]: With dead ends: 215 [2020-10-16 13:44:05,198 INFO L226 Difference]: Without dead ends: 147 [2020-10-16 13:44:05,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:44:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-16 13:44:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-10-16 13:44:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-16 13:44:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 320 transitions. [2020-10-16 13:44:05,204 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 320 transitions. Word has length 12 [2020-10-16 13:44:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:05,204 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 320 transitions. [2020-10-16 13:44:05,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:44:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 320 transitions. [2020-10-16 13:44:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:44:05,206 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:05,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:44:05,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:44:05,207 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:05,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:05,207 INFO L82 PathProgramCache]: Analyzing trace with hash 916751386, now seen corresponding path program 1 times [2020-10-16 13:44:05,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:05,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128006170] [2020-10-16 13:44:05,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:05,381 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-16 13:44:05,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128006170] [2020-10-16 13:44:05,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:05,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:44:05,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1151373282] [2020-10-16 13:44:05,382 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:05,387 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:05,405 INFO L258 McrAutomatonBuilder]: Finished intersection with 59 states and 112 transitions. [2020-10-16 13:44:05,406 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:05,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,471 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:05,486 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:05,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:05,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:05,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,648 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:05,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:05,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:05,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:05,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:05,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,854 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:05,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:05,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,864 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,866 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,867 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,868 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-16 13:44:05,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:05,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:05,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:05,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:05,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:05,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,015 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:06,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-16 13:44:06,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,128 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:06,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:06,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,140 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:06,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,146 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:06,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,168 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,178 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,194 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,196 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:06,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,214 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,224 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:06,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,314 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:06,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:06,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,321 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:06,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,327 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,331 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,336 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,337 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:06,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,359 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,371 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,377 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,398 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:06,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,427 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:06,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,456 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:06,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:06,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-16 13:44:06,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,567 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:06,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,687 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:06,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,689 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,690 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,691 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,692 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:06,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,766 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:06,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,771 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:06,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:06,773 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:06,776 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-16 13:44:06,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,792 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,799 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:44:06,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,803 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:06,806 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-16 13:44:06,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,821 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,827 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:44:06,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,834 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:44:06,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,835 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:06,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,845 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:44:06,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:06,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,878 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,882 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:06,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,884 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:06,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,885 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:06,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:06,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,902 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:06,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:06,916 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:06,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,938 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:06,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:06,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:06,961 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:06,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:06,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,977 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:06,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:06,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:06,994 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:06,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,009 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:07,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,010 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:07,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,016 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:07,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:07,028 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:07,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:07,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:07,041 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:07,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,055 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:07,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,067 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:07,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:07,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,072 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:07,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:07,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,083 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:44:07,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,089 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:07,095 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:44:07,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:07,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:07,135 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5841#(and (= ~x$w_buff0~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-16 13:44:07,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:44:07,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:44:07,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:44:07,136 INFO L87 Difference]: Start difference. First operand 147 states and 320 transitions. Second operand 6 states. [2020-10-16 13:44:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:07,238 INFO L93 Difference]: Finished difference Result 228 states and 485 transitions. [2020-10-16 13:44:07,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:44:07,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 13:44:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:07,240 INFO L225 Difference]: With dead ends: 228 [2020-10-16 13:44:07,241 INFO L226 Difference]: Without dead ends: 186 [2020-10-16 13:44:07,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:44:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-16 13:44:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2020-10-16 13:44:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-16 13:44:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 310 transitions. [2020-10-16 13:44:07,246 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 310 transitions. Word has length 17 [2020-10-16 13:44:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:07,247 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 310 transitions. [2020-10-16 13:44:07,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:44:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 310 transitions. [2020-10-16 13:44:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:44:07,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:07,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:44:07,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:44:07,249 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1495949804, now seen corresponding path program 2 times [2020-10-16 13:44:07,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:07,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075589516] [2020-10-16 13:44:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:07,440 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-16 13:44:07,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075589516] [2020-10-16 13:44:07,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:07,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:44:07,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [287450577] [2020-10-16 13:44:07,442 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:07,445 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:07,461 INFO L258 McrAutomatonBuilder]: Finished intersection with 57 states and 106 transitions. [2020-10-16 13:44:07,462 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:07,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:07,690 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6373#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:44:07,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:44:07,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:44:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:44:07,691 INFO L87 Difference]: Start difference. First operand 147 states and 310 transitions. Second operand 7 states. [2020-10-16 13:44:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:07,741 INFO L93 Difference]: Finished difference Result 131 states and 276 transitions. [2020-10-16 13:44:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:44:07,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 13:44:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:07,743 INFO L225 Difference]: With dead ends: 131 [2020-10-16 13:44:07,743 INFO L226 Difference]: Without dead ends: 121 [2020-10-16 13:44:07,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:44:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-16 13:44:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-16 13:44:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-16 13:44:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 258 transitions. [2020-10-16 13:44:07,748 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 258 transitions. Word has length 17 [2020-10-16 13:44:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:07,748 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 258 transitions. [2020-10-16 13:44:07,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:44:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 258 transitions. [2020-10-16 13:44:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:44:07,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:07,750 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] [2020-10-16 13:44:07,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:44:07,750 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:07,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:07,750 INFO L82 PathProgramCache]: Analyzing trace with hash -676783041, now seen corresponding path program 1 times [2020-10-16 13:44:07,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:07,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238594924] [2020-10-16 13:44:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:07,807 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-16 13:44:07,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238594924] [2020-10-16 13:44:07,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:07,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:44:07,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910923209] [2020-10-16 13:44:07,808 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:07,812 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:07,830 INFO L258 McrAutomatonBuilder]: Finished intersection with 55 states and 98 transitions. [2020-10-16 13:44:07,830 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:07,898 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:44:07,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:44:07,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:44:07,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:44:07,900 INFO L87 Difference]: Start difference. First operand 121 states and 258 transitions. Second operand 4 states. [2020-10-16 13:44:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:07,913 INFO L93 Difference]: Finished difference Result 150 states and 312 transitions. [2020-10-16 13:44:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:44:07,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-16 13:44:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:07,914 INFO L225 Difference]: With dead ends: 150 [2020-10-16 13:44:07,914 INFO L226 Difference]: Without dead ends: 61 [2020-10-16 13:44:07,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-16 13:44:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-16 13:44:07,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-16 13:44:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-16 13:44:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2020-10-16 13:44:07,917 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 20 [2020-10-16 13:44:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:07,918 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2020-10-16 13:44:07,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:44:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2020-10-16 13:44:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:44:07,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:07,919 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] [2020-10-16 13:44:07,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:44:07,919 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1461704659, now seen corresponding path program 2 times [2020-10-16 13:44:07,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:07,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382076032] [2020-10-16 13:44:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:44:08,139 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-16 13:44:08,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382076032] [2020-10-16 13:44:08,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:44:08,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:44:08,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [238503277] [2020-10-16 13:44:08,140 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:44:08,145 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:44:08,159 INFO L258 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2020-10-16 13:44:08,160 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:44:08,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,184 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:08,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,185 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:08,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,187 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,198 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,219 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,222 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:08,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,234 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:44:08,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,268 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:08,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:08,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:08,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,275 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,278 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts [2020-10-16 13:44:08,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,280 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,299 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:44:08,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,311 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:44:08,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,321 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,327 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:44:08,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,336 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,337 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,342 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts [2020-10-16 13:44:08,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,346 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,372 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:44:08,387 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:44:08,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,395 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,404 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:44:08,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,412 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:44:08,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,551 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:08,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,553 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:08,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,554 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:44:08,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:44:08,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,557 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:08,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:08,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,560 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:08,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:08,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:44:08,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,656 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,660 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:08,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:08,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,662 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:08,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,663 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,670 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:08,681 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,684 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:08,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,713 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,725 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:08,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,748 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:08,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,786 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,808 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:08,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,847 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:08,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,852 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:08,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,853 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:08,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,857 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:44:08,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,866 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:08,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:08,877 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,877 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:08,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,889 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-16 13:44:08,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:08,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,926 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:08,927 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:08,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:08,941 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-16 13:44:08,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,943 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:44:08,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:08,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:08,978 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-16 13:44:08,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,013 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:09,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:09,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:09,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,022 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:44:09,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,026 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:09,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:09,040 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:09,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,046 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:09,058 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:09,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,063 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:09,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,078 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:09,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:09,109 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:09,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,128 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:09,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,148 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:44:09,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:09,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,283 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:09,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:44:09,286 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:09,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,308 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:44:09,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,356 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:44:09,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,394 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:44:09,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:44:09,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,398 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:44:09,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,403 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:09,409 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:44:09,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,411 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:44:09,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,416 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:09,420 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:09,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:44:09,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,439 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:09,444 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:44:09,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:44:09,459 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:44:09,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:44:09,479 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7035#(and (= ~x$w_buff0~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= ~x$r_buff1_thd3~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-16 13:44:09,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:44:09,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:44:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:44:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:44:09,480 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand 8 states. [2020-10-16 13:44:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:44:09,615 INFO L93 Difference]: Finished difference Result 71 states and 124 transitions. [2020-10-16 13:44:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:44:09,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-16 13:44:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:44:09,617 INFO L225 Difference]: With dead ends: 71 [2020-10-16 13:44:09,617 INFO L226 Difference]: Without dead ends: 41 [2020-10-16 13:44:09,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-16 13:44:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-16 13:44:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-16 13:44:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-16 13:44:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-16 13:44:09,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20 [2020-10-16 13:44:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:44:09,620 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-16 13:44:09,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:44:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-16 13:44:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:44:09,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:44:09,621 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] [2020-10-16 13:44:09,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:44:09,621 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:44:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:44:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1943336717, now seen corresponding path program 3 times [2020-10-16 13:44:09,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:44:09,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804342622] [2020-10-16 13:44:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:44:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:44:09,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:44:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:44:09,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:44:09,754 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:44:09,754 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:44:09,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:44:09,755 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:44:09,804 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L4-->L838: Formula: (let ((.cse6 (= (mod ~x$w_buff1_used~0_In2093440612 256) 0)) (.cse7 (= (mod ~x$r_buff1_thd0~0_In2093440612 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In2093440612 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In2093440612 256) 0))) (let ((.cse3 (not .cse8)) (.cse4 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out2093440612 ~x$r_buff1_thd0~0_In2093440612) (or (and (= ~x$w_buff1_used~0_In2093440612 ~x$w_buff1_used~0_Out2093440612) .cse0) (and (= ~x$w_buff1_used~0_Out2093440612 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In2093440612 0)) (= ~x$r_buff0_thd0~0_In2093440612 ~x$r_buff0_thd0~0_Out2093440612) (or (and .cse3 .cse4 (= ~x$w_buff0_used~0_Out2093440612 0)) (and .cse5 (= ~x$w_buff0_used~0_Out2093440612 ~x$w_buff0_used~0_In2093440612))) (or (and .cse3 .cse4 (= ~x$w_buff0~0_In2093440612 ~x~0_Out2093440612)) (and .cse5 (or (and (= ~x~0_In2093440612 ~x~0_Out2093440612) .cse0) (and .cse1 .cse2 (= ~x$w_buff1~0_In2093440612 ~x~0_Out2093440612)))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2093440612, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2093440612, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In2093440612, ~x$w_buff1~0=~x$w_buff1~0_In2093440612, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2093440612, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2093440612, ~x~0=~x~0_In2093440612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2093440612} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2093440612, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out2093440612, ~x$w_buff1~0=~x$w_buff1~0_In2093440612, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out2093440612, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out2093440612, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2093440612|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2093440612|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2093440612|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out2093440612, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2093440612|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2093440612|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2093440612|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In2093440612, ~x~0=~x~0_Out2093440612} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2020-10-16 13:44:09,811 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-16 13:44:09,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,812 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-16 13:44:09,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,812 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-16 13:44:09,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,813 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-16 13:44:09,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,813 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-16 13:44:09,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,814 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-16 13:44:09,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,814 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-16 13:44:09,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,815 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-16 13:44:09,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,815 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-16 13:44:09,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,815 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-16 13:44:09,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,816 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-16 13:44:09,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,816 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-16 13:44:09,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,816 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-16 13:44:09,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,817 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-16 13:44:09,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,817 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-16 13:44:09,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,817 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-16 13:44:09,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,818 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-16 13:44:09,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,818 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-16 13:44:09,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,818 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-16 13:44:09,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,819 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-16 13:44:09,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,819 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-16 13:44:09,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,820 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-16 13:44:09,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,820 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-16 13:44:09,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,820 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-16 13:44:09,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,821 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-16 13:44:09,821 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:44:09,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:44:09 BasicIcfg [2020-10-16 13:44:09,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:44:09,881 INFO L168 Benchmark]: Toolchain (without parser) took 11592.56 ms. Allocated memory was 140.0 MB in the beginning and 455.1 MB in the end (delta: 315.1 MB). Free memory was 101.9 MB in the beginning and 392.2 MB in the end (delta: -290.4 MB). Peak memory consumption was 273.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:44:09,881 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:44:09,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.53 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 101.4 MB in the beginning and 155.9 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-10-16 13:44:09,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.21 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 13:44:09,883 INFO L168 Benchmark]: Boogie Preprocessor took 49.08 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:44:09,884 INFO L168 Benchmark]: RCFGBuilder took 2094.66 ms. Allocated memory was 202.4 MB in the beginning and 246.4 MB in the end (delta: 44.0 MB). Free memory was 151.2 MB in the beginning and 196.7 MB in the end (delta: -45.5 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. [2020-10-16 13:44:09,885 INFO L168 Benchmark]: TraceAbstraction took 8574.31 ms. Allocated memory was 246.4 MB in the beginning and 455.1 MB in the end (delta: 208.7 MB). Free memory was 196.7 MB in the beginning and 392.2 MB in the end (delta: -195.5 MB). Peak memory consumption was 261.5 MB. Max. memory is 7.1 GB. [2020-10-16 13:44:09,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.53 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 101.4 MB in the beginning and 155.9 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.21 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.08 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2094.66 ms. Allocated memory was 202.4 MB in the beginning and 246.4 MB in the end (delta: 44.0 MB). Free memory was 151.2 MB in the beginning and 196.7 MB in the end (delta: -45.5 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8574.31 ms. Allocated memory was 246.4 MB in the beginning and 455.1 MB in the end (delta: 208.7 MB). Free memory was 196.7 MB in the beginning and 392.2 MB in the end (delta: -195.5 MB). Peak memory consumption was 261.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 808 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 79 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.5s, 101 PlacesBefore, 35 PlacesAfterwards, 93 TransitionsBefore, 25 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 74 TotalNumberOfCompositions, 3641 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L710] 0 _Bool x$flush_delayed; [L711] 0 int x$mem_tmp; [L712] 0 _Bool x$r_buff0_thd0; [L713] 0 _Bool x$r_buff0_thd1; [L714] 0 _Bool x$r_buff0_thd2; [L715] 0 _Bool x$r_buff0_thd3; [L716] 0 _Bool x$r_buff1_thd0; [L717] 0 _Bool x$r_buff1_thd1; [L718] 0 _Bool x$r_buff1_thd2; [L719] 0 _Bool x$r_buff1_thd3; [L720] 0 _Bool x$read_delayed; [L721] 0 int *x$read_delayed_var; [L722] 0 int x$w_buff0; [L723] 0 _Bool x$w_buff0_used; [L724] 0 int x$w_buff1; [L725] 0 _Bool x$w_buff1_used; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L822] 0 pthread_t t2354; [L823] FCALL, FORK 0 pthread_create(&t2354, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2355; [L825] FCALL, FORK 0 pthread_create(&t2355, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L826] 0 pthread_t t2356; [L827] FCALL, FORK 0 pthread_create(&t2356, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 1 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L794] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L735] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L800] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L800] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L804] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L749] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L829] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 196 SDtfs, 185 SDslu, 372 SDs, 0 SdLazy, 155 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 121 SyntacticMatches, 26 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 39 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 7722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...