/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:21:03,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:21:03,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:21:03,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:21:03,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:21:03,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:21:03,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:21:03,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:21:03,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:21:03,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:21:03,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:21:03,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:21:03,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:21:03,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:21:03,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:21:03,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:21:03,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:21:03,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:21:03,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:21:03,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:21:03,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:21:03,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:21:03,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:21:03,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:21:03,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:21:03,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:21:03,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:21:03,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:21:03,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:21:03,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:21:03,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:21:03,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:21:03,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:21:03,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:21:03,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:21:03,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:21:03,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:21:03,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:21:03,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:21:03,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:21:03,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:21:03,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:21:03,262 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:21:03,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:21:03,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:21:03,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:21:03,265 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:21:03,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:21:03,265 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:21:03,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:21:03,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:21:03,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:21:03,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:21:03,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:21:03,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:21:03,268 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:21:03,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:21:03,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:21:03,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:21:03,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:21:03,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:21:03,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:21:03,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:21:03,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:21:03,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:21:03,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:21:03,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:21:03,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:21:03,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:21:03,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:21:03,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:21:03,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:21:03,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:21:03,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:21:03,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:21:03,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:21:03,580 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:21:03,581 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2020-10-15 18:21:03,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f790c74/faa73ae85e0d4d818c50351d9b519af4/FLAG9c1ee898b [2020-10-15 18:21:04,200 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:21:04,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2020-10-15 18:21:04,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f790c74/faa73ae85e0d4d818c50351d9b519af4/FLAG9c1ee898b [2020-10-15 18:21:04,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f790c74/faa73ae85e0d4d818c50351d9b519af4 [2020-10-15 18:21:04,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:21:04,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:21:04,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:21:04,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:21:04,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:21:04,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:21:04" (1/1) ... [2020-10-15 18:21:04,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bed9109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:04, skipping insertion in model container [2020-10-15 18:21:04,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:21:04" (1/1) ... [2020-10-15 18:21:04,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:21:04,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:21:05,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:21:05,171 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:21:05,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:21:05,328 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:21:05,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05 WrapperNode [2020-10-15 18:21:05,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:21:05,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:21:05,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:21:05,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:21:05,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:21:05,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:21:05,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:21:05,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:21:05,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... [2020-10-15 18:21:05,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:21:05,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:21:05,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:21:05,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:21:05,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:21:05,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:21:05,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:21:05,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:21:05,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:21:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:21:05,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:21:05,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:21:05,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:21:05,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:21:05,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:21:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:21:05,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:21:05,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:21:05,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:21:05,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:21:05,528 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:21:07,431 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:21:07,432 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:21:07,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:21:07 BoogieIcfgContainer [2020-10-15 18:21:07,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:21:07,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:21:07,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:21:07,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:21:07,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:21:04" (1/3) ... [2020-10-15 18:21:07,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f24d6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:21:07, skipping insertion in model container [2020-10-15 18:21:07,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:21:05" (2/3) ... [2020-10-15 18:21:07,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f24d6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:21:07, skipping insertion in model container [2020-10-15 18:21:07,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:21:07" (3/3) ... [2020-10-15 18:21:07,444 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i [2020-10-15 18:21:07,457 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:21:07,457 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:21:07,466 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:21:07,468 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:21:07,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,501 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,501 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,503 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,503 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,509 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,521 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,524 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,525 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,527 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,528 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:21:07,546 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:21:07,569 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:21:07,570 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:21:07,570 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:21:07,570 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:21:07,570 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:21:07,570 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:21:07,571 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:21:07,571 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:21:07,586 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:21:07,589 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-15 18:21:07,593 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-15 18:21:07,595 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-15 18:21:07,651 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-15 18:21:07,651 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:21:07,656 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-15 18:21:07,661 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-15 18:21:07,952 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:21:08,390 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:21:08,511 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 18:21:08,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:08,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-15 18:21:08,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:08,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:08,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:08,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:08,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:21:08,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:08,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:08,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:08,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:08,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:08,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:08,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:08,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:08,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:08,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:08,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:08,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:08,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:08,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:08,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:08,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:08,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:08,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:09,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:09,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:09,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:09,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:09,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:09,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:09,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:09,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:09,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:09,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:09,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:09,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:09,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:09,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:09,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:09,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:09,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:09,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:09,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:21:09,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:09,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:10,332 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-15 18:21:10,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-15 18:21:10,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:10,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:10,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,246 WARN L193 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-15 18:21:11,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:11,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:11,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-15 18:21:11,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:11,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:11,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:11,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:11,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:11,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:11,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:11,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:11,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:11,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:21:11,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-15 18:21:11,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:11,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:11,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:11,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:21:11,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:21:11,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:11,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:11,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:11,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:11,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:11,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:11,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:11,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:11,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:11,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:11,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:21:11,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,200 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:21:12,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-15 18:21:12,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:12,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:21:12,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:21:12,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-15 18:21:12,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:12,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-15 18:21:12,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:12,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-15 18:21:12,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:13,818 WARN L193 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-15 18:21:14,190 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-15 18:21:14,897 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-15 18:21:15,205 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-15 18:21:15,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:15,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:15,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:15,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:15,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:15,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:15,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:15,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:15,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:15,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:15,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:15,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:15,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:15,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:15,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:15,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:16,729 WARN L193 SmtUtils]: Spent 995.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-10-15 18:21:17,086 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-10-15 18:21:17,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:17,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:17,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:17,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:17,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:17,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:17,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:17,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:21:17,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:17,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:17,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:17,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:21:17,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:21:17,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:17,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:21:17,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:21:17,714 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-15 18:21:17,845 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-15 18:21:17,855 INFO L132 LiptonReduction]: Checked pairs total: 6932 [2020-10-15 18:21:17,855 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-15 18:21:17,862 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-15 18:21:18,020 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-15 18:21:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-15 18:21:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:21:18,030 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:18,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:18,032 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1805630863, now seen corresponding path program 1 times [2020-10-15 18:21:18,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:18,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169817971] [2020-10-15 18:21:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:18,355 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-15 18:21:18,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169817971] [2020-10-15 18:21:18,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:18,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:18,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335837614] [2020-10-15 18:21:18,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:18,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:18,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:18,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:18,381 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-15 18:21:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:18,509 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-15 18:21:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:18,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:21:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:18,583 INFO L225 Difference]: With dead ends: 2602 [2020-10-15 18:21:18,586 INFO L226 Difference]: Without dead ends: 2122 [2020-10-15 18:21:18,587 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-15 18:21:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-15 18:21:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-15 18:21:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-15 18:21:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-15 18:21:18,794 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-15 18:21:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:18,796 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-15 18:21:18,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-15 18:21:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:21:18,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:18,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:18,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:21:18,802 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash 44553062, now seen corresponding path program 1 times [2020-10-15 18:21:18,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:18,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321321186] [2020-10-15 18:21:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:18,938 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-15 18:21:18,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321321186] [2020-10-15 18:21:18,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:18,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:18,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914359362] [2020-10-15 18:21:18,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:18,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:18,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:18,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:18,942 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-15 18:21:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:18,992 INFO L93 Difference]: Finished difference Result 2112 states and 8032 transitions. [2020-10-15 18:21:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:18,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 18:21:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:19,012 INFO L225 Difference]: With dead ends: 2112 [2020-10-15 18:21:19,012 INFO L226 Difference]: Without dead ends: 2112 [2020-10-15 18:21:19,013 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-15 18:21:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2020-10-15 18:21:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2020-10-15 18:21:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2020-10-15 18:21:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 8032 transitions. [2020-10-15 18:21:19,101 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 8032 transitions. Word has length 11 [2020-10-15 18:21:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:19,101 INFO L481 AbstractCegarLoop]: Abstraction has 2112 states and 8032 transitions. [2020-10-15 18:21:19,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 8032 transitions. [2020-10-15 18:21:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:21:19,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:19,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:19,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:21:19,109 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1866863478, now seen corresponding path program 1 times [2020-10-15 18:21:19,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:19,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143406900] [2020-10-15 18:21:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:19,231 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-15 18:21:19,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143406900] [2020-10-15 18:21:19,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:19,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:19,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392863716] [2020-10-15 18:21:19,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:19,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:19,234 INFO L87 Difference]: Start difference. First operand 2112 states and 8032 transitions. Second operand 3 states. [2020-10-15 18:21:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:19,297 INFO L93 Difference]: Finished difference Result 2042 states and 7736 transitions. [2020-10-15 18:21:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:19,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 18:21:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:19,318 INFO L225 Difference]: With dead ends: 2042 [2020-10-15 18:21:19,318 INFO L226 Difference]: Without dead ends: 2042 [2020-10-15 18:21:19,319 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-15 18:21:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2020-10-15 18:21:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2020-10-15 18:21:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2020-10-15 18:21:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7736 transitions. [2020-10-15 18:21:19,401 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 7736 transitions. Word has length 12 [2020-10-15 18:21:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:19,402 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 7736 transitions. [2020-10-15 18:21:19,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 7736 transitions. [2020-10-15 18:21:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:21:19,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:19,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:19,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:21:19,405 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:19,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1379604367, now seen corresponding path program 1 times [2020-10-15 18:21:19,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:19,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32554189] [2020-10-15 18:21:19,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:19,479 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-15 18:21:19,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32554189] [2020-10-15 18:21:19,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:19,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:19,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268672024] [2020-10-15 18:21:19,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:19,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:19,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:19,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:19,485 INFO L87 Difference]: Start difference. First operand 2042 states and 7736 transitions. Second operand 3 states. [2020-10-15 18:21:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:19,514 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-10-15 18:21:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:19,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 18:21:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:19,533 INFO L225 Difference]: With dead ends: 1962 [2020-10-15 18:21:19,534 INFO L226 Difference]: Without dead ends: 1962 [2020-10-15 18:21:19,534 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-15 18:21:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-10-15 18:21:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-10-15 18:21:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-15 18:21:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-10-15 18:21:19,685 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 12 [2020-10-15 18:21:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:19,686 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-10-15 18:21:19,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-10-15 18:21:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:21:19,690 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:19,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:19,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:21:19,691 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:19,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash -182792945, now seen corresponding path program 1 times [2020-10-15 18:21:19,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:19,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969578161] [2020-10-15 18:21:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:19,815 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-15 18:21:19,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969578161] [2020-10-15 18:21:19,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:19,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:19,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935642012] [2020-10-15 18:21:19,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:21:19,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:21:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:19,817 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-10-15 18:21:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:19,966 INFO L93 Difference]: Finished difference Result 2046 states and 7749 transitions. [2020-10-15 18:21:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:21:19,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 18:21:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:19,991 INFO L225 Difference]: With dead ends: 2046 [2020-10-15 18:21:19,991 INFO L226 Difference]: Without dead ends: 2046 [2020-10-15 18:21:19,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2020-10-15 18:21:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1998. [2020-10-15 18:21:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2020-10-15 18:21:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7527 transitions. [2020-10-15 18:21:20,081 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7527 transitions. Word has length 13 [2020-10-15 18:21:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:20,082 INFO L481 AbstractCegarLoop]: Abstraction has 1998 states and 7527 transitions. [2020-10-15 18:21:20,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:21:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7527 transitions. [2020-10-15 18:21:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:21:20,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:20,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:20,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:21:20,084 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:20,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash -134224625, now seen corresponding path program 2 times [2020-10-15 18:21:20,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:20,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600019707] [2020-10-15 18:21:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:20,129 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-15 18:21:20,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600019707] [2020-10-15 18:21:20,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:20,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:21:20,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706645267] [2020-10-15 18:21:20,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:20,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:20,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:20,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:20,131 INFO L87 Difference]: Start difference. First operand 1998 states and 7527 transitions. Second operand 3 states. [2020-10-15 18:21:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:20,157 INFO L93 Difference]: Finished difference Result 1958 states and 7345 transitions. [2020-10-15 18:21:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:20,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 18:21:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:20,185 INFO L225 Difference]: With dead ends: 1958 [2020-10-15 18:21:20,186 INFO L226 Difference]: Without dead ends: 1958 [2020-10-15 18:21:20,186 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-15 18:21:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2020-10-15 18:21:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1958. [2020-10-15 18:21:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2020-10-15 18:21:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 7345 transitions. [2020-10-15 18:21:20,258 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 7345 transitions. Word has length 13 [2020-10-15 18:21:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:20,258 INFO L481 AbstractCegarLoop]: Abstraction has 1958 states and 7345 transitions. [2020-10-15 18:21:20,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 7345 transitions. [2020-10-15 18:21:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:21:20,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:20,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:20,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:21:20,261 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:20,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1289139937, now seen corresponding path program 1 times [2020-10-15 18:21:20,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:20,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883471797] [2020-10-15 18:21:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:20,391 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-15 18:21:20,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883471797] [2020-10-15 18:21:20,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:20,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:21:20,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109135342] [2020-10-15 18:21:20,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:21:20,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:21:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:21:20,394 INFO L87 Difference]: Start difference. First operand 1958 states and 7345 transitions. Second operand 4 states. [2020-10-15 18:21:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:20,464 INFO L93 Difference]: Finished difference Result 2186 states and 8233 transitions. [2020-10-15 18:21:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:21:20,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 18:21:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:20,487 INFO L225 Difference]: With dead ends: 2186 [2020-10-15 18:21:20,487 INFO L226 Difference]: Without dead ends: 2186 [2020-10-15 18:21:20,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:21:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2020-10-15 18:21:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2162. [2020-10-15 18:21:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2162 states. [2020-10-15 18:21:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 8146 transitions. [2020-10-15 18:21:20,569 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 8146 transitions. Word has length 14 [2020-10-15 18:21:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:20,569 INFO L481 AbstractCegarLoop]: Abstraction has 2162 states and 8146 transitions. [2020-10-15 18:21:20,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:21:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 8146 transitions. [2020-10-15 18:21:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:21:20,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:20,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:20,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:21:20,572 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1240571617, now seen corresponding path program 2 times [2020-10-15 18:21:20,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:20,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451866067] [2020-10-15 18:21:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:21:20,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451866067] [2020-10-15 18:21:20,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:20,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:20,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605641662] [2020-10-15 18:21:20,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:21:20,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:21:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:20,683 INFO L87 Difference]: Start difference. First operand 2162 states and 8146 transitions. Second operand 5 states. [2020-10-15 18:21:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:20,743 INFO L93 Difference]: Finished difference Result 2106 states and 7898 transitions. [2020-10-15 18:21:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:21:20,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 18:21:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:20,754 INFO L225 Difference]: With dead ends: 2106 [2020-10-15 18:21:20,754 INFO L226 Difference]: Without dead ends: 2106 [2020-10-15 18:21:20,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2020-10-15 18:21:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2106. [2020-10-15 18:21:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-15 18:21:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7898 transitions. [2020-10-15 18:21:20,825 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7898 transitions. Word has length 14 [2020-10-15 18:21:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:20,825 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7898 transitions. [2020-10-15 18:21:20,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:21:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7898 transitions. [2020-10-15 18:21:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:21:20,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:20,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:20,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:21:20,833 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:20,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1976465858, now seen corresponding path program 1 times [2020-10-15 18:21:20,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:20,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092299353] [2020-10-15 18:21:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:21:20,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092299353] [2020-10-15 18:21:20,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:20,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:20,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478743706] [2020-10-15 18:21:20,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:21:20,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:21:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:21:21,000 INFO L87 Difference]: Start difference. First operand 2106 states and 7898 transitions. Second operand 4 states. [2020-10-15 18:21:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:21,057 INFO L93 Difference]: Finished difference Result 2110 states and 7211 transitions. [2020-10-15 18:21:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:21:21,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:21:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:21,065 INFO L225 Difference]: With dead ends: 2110 [2020-10-15 18:21:21,066 INFO L226 Difference]: Without dead ends: 1582 [2020-10-15 18:21:21,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 18:21:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2020-10-15 18:21:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2020-10-15 18:21:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-10-15 18:21:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 5332 transitions. [2020-10-15 18:21:21,118 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 5332 transitions. Word has length 16 [2020-10-15 18:21:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:21,118 INFO L481 AbstractCegarLoop]: Abstraction has 1582 states and 5332 transitions. [2020-10-15 18:21:21,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:21:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 5332 transitions. [2020-10-15 18:21:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:21:21,122 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:21,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:21,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:21:21,122 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:21,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:21,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1140592967, now seen corresponding path program 1 times [2020-10-15 18:21:21,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:21,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35630055] [2020-10-15 18:21:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:21,276 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-15 18:21:21,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35630055] [2020-10-15 18:21:21,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:21,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:21:21,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169964150] [2020-10-15 18:21:21,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:21:21,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:21,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:21:21,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:21:21,278 INFO L87 Difference]: Start difference. First operand 1582 states and 5332 transitions. Second operand 5 states. [2020-10-15 18:21:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:21,346 INFO L93 Difference]: Finished difference Result 1332 states and 4147 transitions. [2020-10-15 18:21:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:21:21,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:21:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:21,350 INFO L225 Difference]: With dead ends: 1332 [2020-10-15 18:21:21,350 INFO L226 Difference]: Without dead ends: 1011 [2020-10-15 18:21:21,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2020-10-15 18:21:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2020-10-15 18:21:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2020-10-15 18:21:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3084 transitions. [2020-10-15 18:21:21,439 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3084 transitions. Word has length 17 [2020-10-15 18:21:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:21,440 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 3084 transitions. [2020-10-15 18:21:21,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:21:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3084 transitions. [2020-10-15 18:21:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:21:21,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:21,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:21,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:21:21,446 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 709308523, now seen corresponding path program 1 times [2020-10-15 18:21:21,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:21,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653214409] [2020-10-15 18:21:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:21,561 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-15 18:21:21,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653214409] [2020-10-15 18:21:21,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:21,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:21:21,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476430342] [2020-10-15 18:21:21,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:21:21,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:21:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:21,563 INFO L87 Difference]: Start difference. First operand 1011 states and 3084 transitions. Second operand 6 states. [2020-10-15 18:21:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:21,634 INFO L93 Difference]: Finished difference Result 878 states and 2658 transitions. [2020-10-15 18:21:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:21:21,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:21:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:21,638 INFO L225 Difference]: With dead ends: 878 [2020-10-15 18:21:21,639 INFO L226 Difference]: Without dead ends: 776 [2020-10-15 18:21:21,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:21:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2020-10-15 18:21:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 728. [2020-10-15 18:21:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-10-15 18:21:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2217 transitions. [2020-10-15 18:21:21,658 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2217 transitions. Word has length 19 [2020-10-15 18:21:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:21,659 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 2217 transitions. [2020-10-15 18:21:21,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:21:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2217 transitions. [2020-10-15 18:21:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:21:21,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:21,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:21,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:21:21,662 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1754550781, now seen corresponding path program 1 times [2020-10-15 18:21:21,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:21,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257434133] [2020-10-15 18:21:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:21,779 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-15 18:21:21,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257434133] [2020-10-15 18:21:21,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:21,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:21:21,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531724889] [2020-10-15 18:21:21,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:21:21,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:21:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:21:21,782 INFO L87 Difference]: Start difference. First operand 728 states and 2217 transitions. Second operand 9 states. [2020-10-15 18:21:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:21,920 INFO L93 Difference]: Finished difference Result 1058 states and 3156 transitions. [2020-10-15 18:21:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 18:21:21,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 18:21:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:21,923 INFO L225 Difference]: With dead ends: 1058 [2020-10-15 18:21:21,924 INFO L226 Difference]: Without dead ends: 854 [2020-10-15 18:21:21,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:21:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2020-10-15 18:21:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 802. [2020-10-15 18:21:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-10-15 18:21:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2385 transitions. [2020-10-15 18:21:21,948 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 2385 transitions. Word has length 22 [2020-10-15 18:21:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:21,949 INFO L481 AbstractCegarLoop]: Abstraction has 802 states and 2385 transitions. [2020-10-15 18:21:21,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:21:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 2385 transitions. [2020-10-15 18:21:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:21:21,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:21,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:21,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:21:21,952 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash -843942049, now seen corresponding path program 2 times [2020-10-15 18:21:21,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:21,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308089230] [2020-10-15 18:21:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:22,040 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-15 18:21:22,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308089230] [2020-10-15 18:21:22,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:22,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:21:22,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682616556] [2020-10-15 18:21:22,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:21:22,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:21:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:21:22,042 INFO L87 Difference]: Start difference. First operand 802 states and 2385 transitions. Second operand 9 states. [2020-10-15 18:21:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:22,152 INFO L93 Difference]: Finished difference Result 999 states and 2814 transitions. [2020-10-15 18:21:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:21:22,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 18:21:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:22,156 INFO L225 Difference]: With dead ends: 999 [2020-10-15 18:21:22,156 INFO L226 Difference]: Without dead ends: 945 [2020-10-15 18:21:22,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:21:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2020-10-15 18:21:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 849. [2020-10-15 18:21:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-10-15 18:21:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2468 transitions. [2020-10-15 18:21:22,179 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2468 transitions. Word has length 22 [2020-10-15 18:21:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:22,179 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2468 transitions. [2020-10-15 18:21:22,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:21:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2468 transitions. [2020-10-15 18:21:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:21:22,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:22,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:22,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:21:22,182 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 768181909, now seen corresponding path program 3 times [2020-10-15 18:21:22,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:22,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984414432] [2020-10-15 18:21:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:22,222 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-15 18:21:22,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984414432] [2020-10-15 18:21:22,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:22,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:21:22,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949958228] [2020-10-15 18:21:22,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:21:22,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:22,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:21:22,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:21:22,224 INFO L87 Difference]: Start difference. First operand 849 states and 2468 transitions. Second operand 3 states. [2020-10-15 18:21:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:22,238 INFO L93 Difference]: Finished difference Result 1153 states and 3256 transitions. [2020-10-15 18:21:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:21:22,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-10-15 18:21:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:22,241 INFO L225 Difference]: With dead ends: 1153 [2020-10-15 18:21:22,242 INFO L226 Difference]: Without dead ends: 725 [2020-10-15 18:21:22,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 18:21:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2020-10-15 18:21:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 723. [2020-10-15 18:21:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-10-15 18:21:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1944 transitions. [2020-10-15 18:21:22,260 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1944 transitions. Word has length 22 [2020-10-15 18:21:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:22,260 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 1944 transitions. [2020-10-15 18:21:22,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:21:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1944 transitions. [2020-10-15 18:21:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:21:22,263 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:22,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:22,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:21:22,263 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash 730025773, now seen corresponding path program 4 times [2020-10-15 18:21:22,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:22,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484108974] [2020-10-15 18:21:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:22,353 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-15 18:21:22,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484108974] [2020-10-15 18:21:22,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:22,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:21:22,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025414267] [2020-10-15 18:21:22,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:21:22,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:21:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:21:22,355 INFO L87 Difference]: Start difference. First operand 723 states and 1944 transitions. Second operand 7 states. [2020-10-15 18:21:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:22,424 INFO L93 Difference]: Finished difference Result 697 states and 1891 transitions. [2020-10-15 18:21:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:21:22,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 18:21:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:22,427 INFO L225 Difference]: With dead ends: 697 [2020-10-15 18:21:22,427 INFO L226 Difference]: Without dead ends: 473 [2020-10-15 18:21:22,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:21:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-10-15 18:21:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2020-10-15 18:21:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2020-10-15 18:21:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1264 transitions. [2020-10-15 18:21:22,438 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1264 transitions. Word has length 22 [2020-10-15 18:21:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:22,439 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 1264 transitions. [2020-10-15 18:21:22,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:21:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1264 transitions. [2020-10-15 18:21:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:21:22,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:22,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:22,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:21:22,441 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1559232615, now seen corresponding path program 1 times [2020-10-15 18:21:22,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:22,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572764503] [2020-10-15 18:21:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:22,493 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-15 18:21:22,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572764503] [2020-10-15 18:21:22,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:22,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:21:22,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772247507] [2020-10-15 18:21:22,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:21:22,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:21:22,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:21:22,495 INFO L87 Difference]: Start difference. First operand 473 states and 1264 transitions. Second operand 4 states. [2020-10-15 18:21:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:22,512 INFO L93 Difference]: Finished difference Result 502 states and 1317 transitions. [2020-10-15 18:21:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:21:22,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-15 18:21:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:22,514 INFO L225 Difference]: With dead ends: 502 [2020-10-15 18:21:22,514 INFO L226 Difference]: Without dead ends: 184 [2020-10-15 18:21:22,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 18:21:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-15 18:21:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2020-10-15 18:21:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-15 18:21:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2020-10-15 18:21:22,519 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 26 [2020-10-15 18:21:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:22,520 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2020-10-15 18:21:22,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:21:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2020-10-15 18:21:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:21:22,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:22,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:22,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:21:22,521 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash 772229995, now seen corresponding path program 2 times [2020-10-15 18:21:22,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:22,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856745704] [2020-10-15 18:21:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:21:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:21:22,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856745704] [2020-10-15 18:21:22,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:21:22,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:21:22,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606659158] [2020-10-15 18:21:22,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:21:22,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:21:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:21:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:21:22,710 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 6 states. [2020-10-15 18:21:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:21:22,822 INFO L93 Difference]: Finished difference Result 246 states and 598 transitions. [2020-10-15 18:21:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:21:22,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-15 18:21:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:21:22,824 INFO L225 Difference]: With dead ends: 246 [2020-10-15 18:21:22,824 INFO L226 Difference]: Without dead ends: 144 [2020-10-15 18:21:22,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:21:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-15 18:21:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-10-15 18:21:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-15 18:21:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 326 transitions. [2020-10-15 18:21:22,828 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 326 transitions. Word has length 26 [2020-10-15 18:21:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:21:22,829 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 326 transitions. [2020-10-15 18:21:22,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:21:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 326 transitions. [2020-10-15 18:21:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:21:22,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:21:22,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:21:22,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:21:22,830 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:21:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:21:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1680604651, now seen corresponding path program 3 times [2020-10-15 18:21:22,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:21:22,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465424351] [2020-10-15 18:21:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:21:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:21:22,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:21:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:21:22,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:21:22,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:21:22,931 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:21:22,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:21:22,932 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:21:22,946 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse6 (= 0 (mod ~z$w_buff1_used~0_In-2146806184 256))) (.cse7 (= (mod ~z$r_buff1_thd0~0_In-2146806184 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In-2146806184 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-2146806184 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~z$r_buff1_thd0~0_In-2146806184 ~z$r_buff1_thd0~0_Out-2146806184) (= ~z$r_buff0_thd0~0_Out-2146806184 ~z$r_buff0_thd0~0_In-2146806184) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2146806184| ULTIMATE.start_assume_abort_if_not_~cond_Out-2146806184) (or (and .cse0 (= ~z$w_buff0_used~0_Out-2146806184 ~z$w_buff0_used~0_In-2146806184)) (and .cse1 .cse2 (= ~z$w_buff0_used~0_Out-2146806184 0))) (or (and .cse0 (or (and (= ~z~0_In-2146806184 ~z~0_Out-2146806184) .cse3) (and .cse4 .cse5 (= ~z$w_buff1~0_In-2146806184 ~z~0_Out-2146806184)))) (and .cse1 (= ~z$w_buff0~0_In-2146806184 ~z~0_Out-2146806184) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2146806184 0)) (or (and .cse3 (= ~z$w_buff1_used~0_Out-2146806184 ~z$w_buff1_used~0_In-2146806184)) (and .cse4 (= ~z$w_buff1_used~0_Out-2146806184 0) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2146806184|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2146806184, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146806184, ~z$w_buff0~0=~z$w_buff0~0_In-2146806184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2146806184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2146806184, ~z$w_buff1~0=~z$w_buff1~0_In-2146806184, ~z~0=~z~0_In-2146806184} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2146806184, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2146806184|, ~z$w_buff0~0=~z$w_buff0~0_In-2146806184, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2146806184|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2146806184, ~z$w_buff1~0=~z$w_buff1~0_In-2146806184, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2146806184|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2146806184|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2146806184|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-2146806184|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2146806184|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2146806184, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2146806184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2146806184, ~z~0=~z~0_Out-2146806184} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-15 18:21:22,953 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-15 18:21:22,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,955 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-15 18:21:22,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,955 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-15 18:21:22,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,956 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-15 18:21:22,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,956 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-15 18:21:22,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,956 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-15 18:21:22,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,957 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-15 18:21:22,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,957 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-15 18:21:22,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,958 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-15 18:21:22,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,958 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-15 18:21:22,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,958 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-15 18:21:22,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,959 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-15 18:21:22,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,959 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-15 18:21:22,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,960 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-15 18:21:22,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,960 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-15 18:21:22,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,961 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-15 18:21:22,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,961 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-15 18:21:22,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,961 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-15 18:21:22,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,962 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-15 18:21:22,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,962 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-15 18:21:22,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,962 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-15 18:21:22,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,963 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-15 18:21:22,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:22,963 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-15 18:21:22,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:21:23,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:21:23 BasicIcfg [2020-10-15 18:21:23,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:21:23,058 INFO L168 Benchmark]: Toolchain (without parser) took 18556.83 ms. Allocated memory was 253.2 MB in the beginning and 593.5 MB in the end (delta: 340.3 MB). Free memory was 207.7 MB in the beginning and 216.0 MB in the end (delta: -8.3 MB). Peak memory consumption was 332.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:23,058 INFO L168 Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:21:23,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.80 ms. Allocated memory was 253.2 MB in the beginning and 321.4 MB in the end (delta: 68.2 MB). Free memory was 207.7 MB in the beginning and 271.7 MB in the end (delta: -63.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:23,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.89 ms. Allocated memory is still 321.4 MB. Free memory was 271.7 MB in the beginning and 269.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:23,060 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 321.4 MB. Free memory was 269.1 MB in the beginning and 266.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:23,061 INFO L168 Benchmark]: RCFGBuilder took 1988.83 ms. Allocated memory was 321.4 MB in the beginning and 361.8 MB in the end (delta: 40.4 MB). Free memory was 266.6 MB in the beginning and 207.9 MB in the end (delta: 58.7 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:23,061 INFO L168 Benchmark]: TraceAbstraction took 15619.74 ms. Allocated memory was 361.8 MB in the beginning and 593.5 MB in the end (delta: 231.7 MB). Free memory was 207.9 MB in the beginning and 216.0 MB in the end (delta: -8.1 MB). Peak memory consumption was 223.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:21:23,064 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.65 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 826.80 ms. Allocated memory was 253.2 MB in the beginning and 321.4 MB in the end (delta: 68.2 MB). Free memory was 207.7 MB in the beginning and 271.7 MB in the end (delta: -63.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 75.89 ms. Allocated memory is still 321.4 MB. Free memory was 271.7 MB in the beginning and 269.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 321.4 MB. Free memory was 269.1 MB in the beginning and 266.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1988.83 ms. Allocated memory was 321.4 MB in the beginning and 361.8 MB in the end (delta: 40.4 MB). Free memory was 266.6 MB in the beginning and 207.9 MB in the end (delta: 58.7 MB). Peak memory consumption was 99.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15619.74 ms. Allocated memory was 361.8 MB in the beginning and 593.5 MB in the end (delta: 231.7 MB). Free memory was 207.9 MB in the beginning and 216.0 MB in the end (delta: -8.1 MB). Peak memory consumption was 223.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1747 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 234 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.2s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 6932 MoverChecksTotal - CounterExampleResult [Line: 7]: 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_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1181; [L836] FCALL, FORK 0 pthread_create(&t1181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1182; [L838] FCALL, FORK 0 pthread_create(&t1182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1183; [L840] FCALL, FORK 0 pthread_create(&t1183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1184; [L842] FCALL, FORK 0 pthread_create(&t1184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 4 z$w_buff1 = z$w_buff0 [L792] 4 z$w_buff0 = 2 [L793] 4 z$w_buff1_used = z$w_buff0_used [L794] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L796] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L801] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 a = 1 [L807] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L759] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L771] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L777] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L777] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L780] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L781] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L784] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 3 return 0; [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 z$flush_delayed = weak$$choice2 [L858] 0 z$mem_tmp = z [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L864] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L867] 0 z = z$flush_delayed ? z$mem_tmp : z [L868] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 544 SDtfs, 713 SDslu, 1028 SDs, 0 SdLazy, 471 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 31381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...