/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/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:38:24,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:38:24,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:38:24,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:38:24,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:38:24,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:38:24,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:38:24,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:38:24,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:38:24,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:38:24,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:38:24,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:38:24,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:38:24,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:38:24,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:38:24,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:38:24,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:38:24,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:38:24,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:38:24,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:38:24,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:38:24,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:38:24,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:38:24,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:38:24,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:38:24,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:38:24,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:38:24,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:38:24,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:38:24,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:38:24,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:38:24,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:38:24,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:38:24,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:38:24,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:38:24,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:38:24,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:38:24,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:38:24,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:38:24,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:38:24,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:38:24,364 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:38:24,417 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:38:24,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:38:24,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:38:24,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:38:24,422 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:38:24,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:38:24,423 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:38:24,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:38:24,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:38:24,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:38:24,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:38:24,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:38:24,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:38:24,424 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:38:24,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:38:24,424 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:38:24,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:38:24,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:38:24,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:38:24,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:38:24,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:38:24,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:38:24,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:38:24,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:38:24,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:38:24,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:38:24,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:38:24,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:38:24,429 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:38:24,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:38:24,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:38:24,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:38:24,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:38:24,771 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:38:24,772 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:38:24,773 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-15 18:38:24,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137f0077b/c84352a27acf4e73ae50f0daf0a59c7a/FLAG314dda7e9 [2020-10-15 18:38:25,407 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:38:25,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2020-10-15 18:38:25,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137f0077b/c84352a27acf4e73ae50f0daf0a59c7a/FLAG314dda7e9 [2020-10-15 18:38:25,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137f0077b/c84352a27acf4e73ae50f0daf0a59c7a [2020-10-15 18:38:25,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:38:25,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:38:25,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:38:25,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:38:25,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:38:25,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:38:25" (1/1) ... [2020-10-15 18:38:25,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1bafec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:25, skipping insertion in model container [2020-10-15 18:38:25,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:38:25" (1/1) ... [2020-10-15 18:38:25,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:38:25,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:38:26,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:38:26,231 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:38:26,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:38:26,420 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:38:26,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26 WrapperNode [2020-10-15 18:38:26,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:38:26,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:38:26,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:38:26,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:38:26,430 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:38:26" (1/1) ... [2020-10-15 18:38:26,448 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:38:26" (1/1) ... [2020-10-15 18:38:26,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:38:26,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:38:26,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:38:26,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:38:26,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (1/1) ... [2020-10-15 18:38:26,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (1/1) ... [2020-10-15 18:38:26,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (1/1) ... [2020-10-15 18:38:26,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (1/1) ... [2020-10-15 18:38:26,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (1/1) ... [2020-10-15 18:38:26,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (1/1) ... [2020-10-15 18:38:26,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (1/1) ... [2020-10-15 18:38:26,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:38:26,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:38:26,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:38:26,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:38:26,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (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:38:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:38:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:38:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:38:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:38:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:38:26,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:38:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:38:26,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:38:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:38:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:38:26,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:38:26,598 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:38:28,594 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:38:28,594 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:38:28,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:38:28 BoogieIcfgContainer [2020-10-15 18:38:28,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:38:28,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:38:28,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:38:28,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:38:28,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:38:25" (1/3) ... [2020-10-15 18:38:28,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e07f5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:38:28, skipping insertion in model container [2020-10-15 18:38:28,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:26" (2/3) ... [2020-10-15 18:38:28,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e07f5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:38:28, skipping insertion in model container [2020-10-15 18:38:28,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:38:28" (3/3) ... [2020-10-15 18:38:28,606 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2020-10-15 18:38:28,619 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:38:28,619 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:38:28,627 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:38:28,628 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:38:28,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,660 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,660 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,660 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,661 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:28,691 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-15 18:38:28,713 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:38:28,713 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:38:28,713 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:38:28,713 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:38:28,714 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:38:28,714 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:38:28,714 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:38:28,714 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:38:28,727 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:38:28,730 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-15 18:38:28,733 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-15 18:38:28,735 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-15 18:38:28,775 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-15 18:38:28,776 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:38:28,780 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-15 18:38:28,783 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-15 18:38:29,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:38:29,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:29,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:38:29,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:38:29,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:38:29,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-15 18:38:29,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:29,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:29,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,201 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:38:30,323 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 18:38:30,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:38:30,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:30,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:30,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:38:30,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:30,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:30,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:30,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:30,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:30,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:30,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:30,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:30,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:30,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:30,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:30,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:30,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:30,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:30,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:30,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:32,036 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-15 18:38:32,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-15 18:38:32,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:32,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:32,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:32,954 WARN L193 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-15 18:38:32,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:32,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:32,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:32,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:32,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:32,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:32,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:32,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:33,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:33,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:33,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:33,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:33,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:34,499 WARN L193 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 116 [2020-10-15 18:38:34,784 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-15 18:38:35,366 WARN L193 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2020-10-15 18:38:35,684 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-15 18:38:35,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:35,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:35,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:35,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:35,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:35,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:35,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:35,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:35,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:35,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:35,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:35,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:35,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:35,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:35,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:35,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:35,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:35,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:36,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:36,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:36,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:36,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:36,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:36,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:36,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:36,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:36,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:36,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:36,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:36,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-10-15 18:38:36,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:36,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-10-15 18:38:36,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-10-15 18:38:36,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-10-15 18:38:36,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-10-15 18:38:36,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-10-15 18:38:36,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:36,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:36,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-15 18:38:36,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:36,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-15 18:38:36,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:36,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-15 18:38:36,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:36,787 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-15 18:38:37,143 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-15 18:38:37,636 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-15 18:38:37,739 INFO L132 LiptonReduction]: Checked pairs total: 2314 [2020-10-15 18:38:37,739 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-15 18:38:37,746 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-10-15 18:38:37,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-15 18:38:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-15 18:38:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 18:38:37,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:37,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 18:38:37,774 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash 860640783, now seen corresponding path program 1 times [2020-10-15 18:38:37,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:37,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093159445] [2020-10-15 18:38:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:38,031 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:38:38,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093159445] [2020-10-15 18:38:38,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:38,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:38:38,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006370593] [2020-10-15 18:38:38,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:38:38,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:38:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:38,057 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-15 18:38:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:38,128 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-15 18:38:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:38,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 18:38:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:38,143 INFO L225 Difference]: With dead ends: 137 [2020-10-15 18:38:38,144 INFO L226 Difference]: Without dead ends: 112 [2020-10-15 18:38:38,145 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:38:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-15 18:38:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-15 18:38:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-15 18:38:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-15 18:38:38,194 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-15 18:38:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:38,194 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-15 18:38:38,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:38:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-15 18:38:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-15 18:38:38,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:38,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:38,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:38:38,196 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1852838512, now seen corresponding path program 1 times [2020-10-15 18:38:38,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:38,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535142820] [2020-10-15 18:38:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:38,315 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:38:38,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535142820] [2020-10-15 18:38:38,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:38,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:38:38,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443430785] [2020-10-15 18:38:38,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:38:38,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:38:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:38,319 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-15 18:38:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:38,331 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-15 18:38:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:38,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-15 18:38:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:38,334 INFO L225 Difference]: With dead ends: 110 [2020-10-15 18:38:38,334 INFO L226 Difference]: Without dead ends: 110 [2020-10-15 18:38:38,335 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:38:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-15 18:38:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-15 18:38:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-15 18:38:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-15 18:38:38,347 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-15 18:38:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:38,347 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-15 18:38:38,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:38:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-15 18:38:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-15 18:38:38,349 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:38,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:38,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:38:38,349 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1603419562, now seen corresponding path program 1 times [2020-10-15 18:38:38,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:38,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093132170] [2020-10-15 18:38:38,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:38,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093132170] [2020-10-15 18:38:38,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:38,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:38:38,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4480606] [2020-10-15 18:38:38,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:38:38,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:38:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:38:38,442 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-15 18:38:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:38,479 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-15 18:38:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:38,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-15 18:38:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:38,482 INFO L225 Difference]: With dead ends: 109 [2020-10-15 18:38:38,482 INFO L226 Difference]: Without dead ends: 109 [2020-10-15 18:38:38,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:38:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-15 18:38:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-15 18:38:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-15 18:38:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-15 18:38:38,494 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-15 18:38:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:38,494 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-15 18:38:38,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:38:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-15 18:38:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:38:38,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:38,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:38,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:38:38,496 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1832994573, now seen corresponding path program 1 times [2020-10-15 18:38:38,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:38,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610595019] [2020-10-15 18:38:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:38,585 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:38:38,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610595019] [2020-10-15 18:38:38,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:38,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:38:38,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204681153] [2020-10-15 18:38:38,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:38:38,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:38,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:38:38,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:38,588 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 3 states. [2020-10-15 18:38:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:38,603 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-15 18:38:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:38,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:38:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:38,606 INFO L225 Difference]: With dead ends: 154 [2020-10-15 18:38:38,606 INFO L226 Difference]: Without dead ends: 118 [2020-10-15 18:38:38,607 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:38:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-15 18:38:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-15 18:38:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-15 18:38:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-15 18:38:38,616 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-15 18:38:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:38,617 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-15 18:38:38,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:38:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-15 18:38:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:38:38,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:38,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:38,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:38:38,618 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1833046095, now seen corresponding path program 1 times [2020-10-15 18:38:38,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:38,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601390014] [2020-10-15 18:38:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:38,770 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:38:38,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601390014] [2020-10-15 18:38:38,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:38,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:38,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047666830] [2020-10-15 18:38:38,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:38,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:38,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:38,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:38,772 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-15 18:38:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:38,806 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-15 18:38:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:38,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-15 18:38:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:38,808 INFO L225 Difference]: With dead ends: 104 [2020-10-15 18:38:38,809 INFO L226 Difference]: Without dead ends: 104 [2020-10-15 18:38:38,809 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:38:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-15 18:38:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-15 18:38:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-15 18:38:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-15 18:38:38,825 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-15 18:38:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:38,825 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-15 18:38:38,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-15 18:38:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:38:38,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:38,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:38,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:38:38,827 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1833599972, now seen corresponding path program 1 times [2020-10-15 18:38:38,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:38,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511663700] [2020-10-15 18:38:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:38,887 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:38:38,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511663700] [2020-10-15 18:38:38,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:38,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:38:38,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864060100] [2020-10-15 18:38:38,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:38:38,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:38,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:38:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:38:38,889 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 4 states. [2020-10-15 18:38:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:38,937 INFO L93 Difference]: Finished difference Result 105 states and 222 transitions. [2020-10-15 18:38:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:38:38,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-15 18:38:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:38,941 INFO L225 Difference]: With dead ends: 105 [2020-10-15 18:38:38,941 INFO L226 Difference]: Without dead ends: 105 [2020-10-15 18:38:38,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:38:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-15 18:38:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-10-15 18:38:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-15 18:38:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 222 transitions. [2020-10-15 18:38:38,949 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 222 transitions. Word has length 9 [2020-10-15 18:38:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:38,949 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 222 transitions. [2020-10-15 18:38:38,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:38:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 222 transitions. [2020-10-15 18:38:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:38:38,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:38,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:38,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:38:38,951 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:38,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1832301692, now seen corresponding path program 2 times [2020-10-15 18:38:38,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:38,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644965745] [2020-10-15 18:38:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:39,046 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:38:39,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644965745] [2020-10-15 18:38:39,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:39,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:39,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195315803] [2020-10-15 18:38:39,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:39,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:39,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:39,049 INFO L87 Difference]: Start difference. First operand 105 states and 222 transitions. Second operand 5 states. [2020-10-15 18:38:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:39,101 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-15 18:38:39,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:38:39,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-15 18:38:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:39,103 INFO L225 Difference]: With dead ends: 102 [2020-10-15 18:38:39,103 INFO L226 Difference]: Without dead ends: 102 [2020-10-15 18:38:39,104 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:38:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-15 18:38:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-15 18:38:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-15 18:38:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-15 18:38:39,109 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-15 18:38:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:39,109 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-15 18:38:39,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-15 18:38:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:38:39,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:39,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:39,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:38:39,111 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:39,111 INFO L82 PathProgramCache]: Analyzing trace with hash 989852939, now seen corresponding path program 1 times [2020-10-15 18:38:39,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:39,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67195330] [2020-10-15 18:38:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:39,199 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:38:39,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67195330] [2020-10-15 18:38:39,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:39,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:39,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464342567] [2020-10-15 18:38:39,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:39,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:39,201 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 5 states. [2020-10-15 18:38:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:39,283 INFO L93 Difference]: Finished difference Result 112 states and 233 transitions. [2020-10-15 18:38:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:38:39,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-15 18:38:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:39,285 INFO L225 Difference]: With dead ends: 112 [2020-10-15 18:38:39,286 INFO L226 Difference]: Without dead ends: 112 [2020-10-15 18:38:39,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:38:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-15 18:38:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-10-15 18:38:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-15 18:38:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 220 transitions. [2020-10-15 18:38:39,291 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 220 transitions. Word has length 10 [2020-10-15 18:38:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:39,292 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 220 transitions. [2020-10-15 18:38:39,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 220 transitions. [2020-10-15 18:38:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:38:39,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:39,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:39,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:38:39,293 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:39,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash 988554659, now seen corresponding path program 2 times [2020-10-15 18:38:39,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:39,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380910964] [2020-10-15 18:38:39,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:39,377 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:38:39,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380910964] [2020-10-15 18:38:39,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:39,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:38:39,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842000647] [2020-10-15 18:38:39,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:38:39,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:38:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:38:39,379 INFO L87 Difference]: Start difference. First operand 106 states and 220 transitions. Second operand 6 states. [2020-10-15 18:38:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:39,499 INFO L93 Difference]: Finished difference Result 112 states and 230 transitions. [2020-10-15 18:38:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:38:39,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-15 18:38:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:39,501 INFO L225 Difference]: With dead ends: 112 [2020-10-15 18:38:39,501 INFO L226 Difference]: Without dead ends: 112 [2020-10-15 18:38:39,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:38:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-15 18:38:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2020-10-15 18:38:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-15 18:38:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-15 18:38:39,505 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-15 18:38:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:39,506 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-15 18:38:39,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:38:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-15 18:38:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:38:39,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:39,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:39,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:38:39,507 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash 569608686, now seen corresponding path program 1 times [2020-10-15 18:38:39,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:39,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284676089] [2020-10-15 18:38:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:39,650 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:38:39,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284676089] [2020-10-15 18:38:39,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:39,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:38:39,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306594380] [2020-10-15 18:38:39,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:39,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:39,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:39,652 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 5 states. [2020-10-15 18:38:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:39,746 INFO L93 Difference]: Finished difference Result 124 states and 238 transitions. [2020-10-15 18:38:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:38:39,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-15 18:38:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:39,749 INFO L225 Difference]: With dead ends: 124 [2020-10-15 18:38:39,749 INFO L226 Difference]: Without dead ends: 97 [2020-10-15 18:38:39,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:38:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-15 18:38:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-15 18:38:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-15 18:38:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 195 transitions. [2020-10-15 18:38:39,755 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 195 transitions. Word has length 11 [2020-10-15 18:38:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:39,755 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 195 transitions. [2020-10-15 18:38:39,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 195 transitions. [2020-10-15 18:38:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:38:39,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:39,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:39,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:38:39,757 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1227689388, now seen corresponding path program 2 times [2020-10-15 18:38:39,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:39,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837866323] [2020-10-15 18:38:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:39,814 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:38:39,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837866323] [2020-10-15 18:38:39,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:39,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:39,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445668404] [2020-10-15 18:38:39,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:38:39,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:39,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:38:39,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:38:39,818 INFO L87 Difference]: Start difference. First operand 97 states and 195 transitions. Second operand 4 states. [2020-10-15 18:38:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:39,852 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2020-10-15 18:38:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:38:39,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 18:38:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:39,854 INFO L225 Difference]: With dead ends: 88 [2020-10-15 18:38:39,854 INFO L226 Difference]: Without dead ends: 66 [2020-10-15 18:38:39,855 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:38:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-15 18:38:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-15 18:38:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-15 18:38:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2020-10-15 18:38:39,859 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 11 [2020-10-15 18:38:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:39,859 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2020-10-15 18:38:39,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:38:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2020-10-15 18:38:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:38:39,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:39,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:39,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:38:39,861 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1195880930, now seen corresponding path program 1 times [2020-10-15 18:38:39,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:39,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799785108] [2020-10-15 18:38:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:39,935 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:38:39,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799785108] [2020-10-15 18:38:39,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:39,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:38:39,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412808036] [2020-10-15 18:38:39,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:39,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:39,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:39,938 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 5 states. [2020-10-15 18:38:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:39,986 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2020-10-15 18:38:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:38:39,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:38:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:39,988 INFO L225 Difference]: With dead ends: 52 [2020-10-15 18:38:39,988 INFO L226 Difference]: Without dead ends: 26 [2020-10-15 18:38:39,989 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:38:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-15 18:38:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-10-15 18:38:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-15 18:38:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-15 18:38:39,991 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-10-15 18:38:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:39,992 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-15 18:38:39,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-15 18:38:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:38:39,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:39,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:39,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:38:39,993 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:39,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1348623678, now seen corresponding path program 1 times [2020-10-15 18:38:39,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:39,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107937942] [2020-10-15 18:38:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:40,252 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:38:40,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107937942] [2020-10-15 18:38:40,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:40,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:38:40,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493807278] [2020-10-15 18:38:40,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:38:40,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:38:40,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:38:40,255 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 7 states. [2020-10-15 18:38:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:40,390 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-10-15 18:38:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:38:40,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-15 18:38:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:40,392 INFO L225 Difference]: With dead ends: 39 [2020-10-15 18:38:40,392 INFO L226 Difference]: Without dead ends: 27 [2020-10-15 18:38:40,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:38:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-15 18:38:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2020-10-15 18:38:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-15 18:38:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-15 18:38:40,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2020-10-15 18:38:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:40,394 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-15 18:38:40,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:38:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-15 18:38:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:38:40,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:40,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:40,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:38:40,396 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1278231562, now seen corresponding path program 2 times [2020-10-15 18:38:40,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:40,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856569969] [2020-10-15 18:38:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:38:40,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:38:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:38:40,486 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:38:40,517 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:38:40,517 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:38:40,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:38:40,518 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:38:40,526 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L3-->L793: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In-1886357107 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In-1886357107 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In-1886357107 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In-1886357107 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~x$r_buff0_thd0~0_Out-1886357107 ~x$r_buff0_thd0~0_In-1886357107) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1886357107 0)) (= ~x$r_buff1_thd0~0_Out-1886357107 ~x$r_buff1_thd0~0_In-1886357107) (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_Out-1886357107 0)) (and .cse2 (= ~x$w_buff1_used~0_In-1886357107 ~x$w_buff1_used~0_Out-1886357107))) (or (and .cse3 (= ~x$w_buff0_used~0_Out-1886357107 0) .cse4) (and .cse5 (= ~x$w_buff0_used~0_In-1886357107 ~x$w_buff0_used~0_Out-1886357107))) (or (and (= ~x~0_Out-1886357107 ~x$w_buff0~0_In-1886357107) .cse3 .cse4) (and .cse5 (or (and .cse2 (= ~x~0_Out-1886357107 ~x~0_In-1886357107)) (and .cse0 (= ~x~0_Out-1886357107 ~x$w_buff1~0_In-1886357107) .cse1))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1886357107, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1886357107, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1886357107, ~x$w_buff1~0=~x$w_buff1~0_In-1886357107, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1886357107, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1886357107, ~x~0=~x~0_In-1886357107, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1886357107} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1886357107, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1886357107, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1886357107|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1886357107|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1886357107|, ~x$w_buff1~0=~x$w_buff1~0_In-1886357107, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1886357107, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1886357107|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1886357107, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1886357107|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1886357107|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1886357107, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1886357107, ~x~0=~x~0_Out-1886357107} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-15 18:38:40,531 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:38:40,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,532 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:38:40,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,533 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:38:40,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,533 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:38:40,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,533 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:38:40,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,534 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:38:40,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,534 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:38:40,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,535 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:38:40,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,535 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:38:40,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,535 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:38:40,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,536 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:38:40,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,536 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:38:40,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,536 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:38:40,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,538 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:38:40,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,538 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:38:40,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,538 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:38:40,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,539 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:38:40,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,539 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:38:40,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,539 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:38:40,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,540 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:38:40,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,540 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:38:40,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,540 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:38:40,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,541 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:38:40,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:40,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:38:40 BasicIcfg [2020-10-15 18:38:40,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:38:40,603 INFO L168 Benchmark]: Toolchain (without parser) took 14917.87 ms. Allocated memory was 255.3 MB in the beginning and 530.1 MB in the end (delta: 274.7 MB). Free memory was 209.8 MB in the beginning and 271.6 MB in the end (delta: -61.7 MB). Peak memory consumption was 213.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:40,603 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 255.3 MB. Free memory is still 231.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:38:40,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.03 ms. Allocated memory was 255.3 MB in the beginning and 324.0 MB in the end (delta: 68.7 MB). Free memory was 209.8 MB in the beginning and 276.8 MB in the end (delta: -67.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:40,605 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.86 ms. Allocated memory is still 324.0 MB. Free memory was 276.8 MB in the beginning and 271.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:40,608 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 324.0 MB. Free memory was 271.8 MB in the beginning and 269.3 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:38:40,610 INFO L168 Benchmark]: RCFGBuilder took 2074.63 ms. Allocated memory was 324.0 MB in the beginning and 363.9 MB in the end (delta: 39.8 MB). Free memory was 269.3 MB in the beginning and 222.1 MB in the end (delta: 47.1 MB). Peak memory consumption was 99.3 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:40,611 INFO L168 Benchmark]: TraceAbstraction took 12002.12 ms. Allocated memory was 363.9 MB in the beginning and 530.1 MB in the end (delta: 166.2 MB). Free memory was 222.1 MB in the beginning and 271.6 MB in the end (delta: -49.4 MB). Peak memory consumption was 116.8 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:40,617 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 ms. Allocated memory is still 255.3 MB. Free memory is still 231.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 735.03 ms. Allocated memory was 255.3 MB in the beginning and 324.0 MB in the end (delta: 68.7 MB). Free memory was 209.8 MB in the beginning and 276.8 MB in the end (delta: -67.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.86 ms. Allocated memory is still 324.0 MB. Free memory was 276.8 MB in the beginning and 271.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 324.0 MB. Free memory was 271.8 MB in the beginning and 269.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2074.63 ms. Allocated memory was 324.0 MB in the beginning and 363.9 MB in the end (delta: 39.8 MB). Free memory was 269.3 MB in the beginning and 222.1 MB in the end (delta: 47.1 MB). Peak memory consumption was 99.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12002.12 ms. Allocated memory was 363.9 MB in the beginning and 530.1 MB in the end (delta: 166.2 MB). Free memory was 222.1 MB in the beginning and 271.6 MB in the end (delta: -49.4 MB). Peak memory consumption was 116.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 581 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 51 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.0s, 79 PlacesBefore, 26 PlacesAfterwards, 74 TransitionsBefore, 20 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2314 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L702] 0 _Bool x$flush_delayed; [L703] 0 int x$mem_tmp; [L704] 0 _Bool x$r_buff0_thd0; [L705] 0 _Bool x$r_buff0_thd1; [L706] 0 _Bool x$r_buff0_thd2; [L707] 0 _Bool x$r_buff1_thd0; [L708] 0 _Bool x$r_buff1_thd1; [L709] 0 _Bool x$r_buff1_thd2; [L710] 0 _Bool x$read_delayed; [L711] 0 int *x$read_delayed_var; [L712] 0 int x$w_buff0; [L713] 0 _Bool x$w_buff0_used; [L714] 0 int x$w_buff1; [L715] 0 _Bool x$w_buff1_used; [L717] 0 int y = 0; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2483; [L780] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2484; [L782] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L800] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 197 SDtfs, 156 SDslu, 221 SDs, 0 SdLazy, 224 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 35 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 7459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...