/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/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:07:12,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:07:12,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:07:12,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:07:12,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:07:12,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:07:12,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:07:12,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:07:12,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:07:12,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:07:12,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:07:12,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:07:12,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:07:12,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:07:12,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:07:12,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:07:12,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:07:12,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:07:12,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:07:12,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:07:12,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:07:12,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:07:12,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:07:12,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:07:12,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:07:12,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:07:12,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:07:12,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:07:12,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:07:12,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:07:12,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:07:12,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:07:12,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:07:12,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:07:12,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:07:12,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:07:12,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:07:12,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:07:12,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:07:12,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:07:12,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:07:12,382 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:07:12,428 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:07:12,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:07:12,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:07:12,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:07:12,430 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:07:12,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:07:12,431 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:07:12,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:07:12,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:07:12,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:07:12,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:07:12,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:07:12,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:07:12,434 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:07:12,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:07:12,434 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:07:12,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:07:12,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:07:12,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:07:12,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:07:12,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:07:12,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:07:12,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:07:12,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:07:12,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:07:12,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:07:12,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:07:12,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:07:12,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:07:12,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:07:12,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:07:12,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:07:12,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:07:12,765 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:07:12,765 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:07:12,766 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-15 18:07:12,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9cdbb495/f66fae4a83a34db296341962484d2897/FLAG0feb4d712 [2020-10-15 18:07:13,359 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:07:13,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-15 18:07:13,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9cdbb495/f66fae4a83a34db296341962484d2897/FLAG0feb4d712 [2020-10-15 18:07:13,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9cdbb495/f66fae4a83a34db296341962484d2897 [2020-10-15 18:07:13,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:07:13,701 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:07:13,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:07:13,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:07:13,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:07:13,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:07:13" (1/1) ... [2020-10-15 18:07:13,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba0a647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:13, skipping insertion in model container [2020-10-15 18:07:13,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:07:13" (1/1) ... [2020-10-15 18:07:13,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:07:13,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:07:14,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:07:14,322 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:07:14,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:07:14,502 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:07:14,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14 WrapperNode [2020-10-15 18:07:14,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:07:14,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:07:14,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:07:14,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:07:14,513 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:07:14" (1/1) ... [2020-10-15 18:07:14,536 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:07:14" (1/1) ... [2020-10-15 18:07:14,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:07:14,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:07:14,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:07:14,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:07:14,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (1/1) ... [2020-10-15 18:07:14,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (1/1) ... [2020-10-15 18:07:14,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (1/1) ... [2020-10-15 18:07:14,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (1/1) ... [2020-10-15 18:07:14,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (1/1) ... [2020-10-15 18:07:14,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (1/1) ... [2020-10-15 18:07:14,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (1/1) ... [2020-10-15 18:07:14,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:07:14,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:07:14,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:07:14,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:07:14,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (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:07:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:07:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:07:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:07:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:07:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:07:14,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:07:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:07:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:07:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:07:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:07:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:07:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:07:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:07:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:07:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:07:14,690 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:07:16,959 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:07:16,960 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:07:16,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:07:16 BoogieIcfgContainer [2020-10-15 18:07:16,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:07:16,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:07:16,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:07:16,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:07:16,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:07:13" (1/3) ... [2020-10-15 18:07:16,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f872d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:07:16, skipping insertion in model container [2020-10-15 18:07:16,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:07:14" (2/3) ... [2020-10-15 18:07:16,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f872d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:07:16, skipping insertion in model container [2020-10-15 18:07:16,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:07:16" (3/3) ... [2020-10-15 18:07:16,974 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2020-10-15 18:07:16,986 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:07:16,987 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:07:16,997 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:07:16,998 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:07:17,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,043 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,047 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,047 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,047 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,048 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,052 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,052 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,057 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,057 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,067 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,068 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,068 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,069 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,069 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,069 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,075 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,075 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,078 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,078 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,079 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,083 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,084 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:07:17,101 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:07:17,121 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:07:17,121 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:07:17,121 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:07:17,121 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:07:17,122 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:07:17,122 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:07:17,122 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:07:17,122 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:07:17,137 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:07:17,140 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-15 18:07:17,143 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-15 18:07:17,145 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-15 18:07:17,199 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-15 18:07:17,200 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:07:17,209 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-15 18:07:17,215 INFO L117 LiptonReduction]: Number of co-enabled transitions 2816 [2020-10-15 18:07:17,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:17,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:17,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:17,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:17,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:17,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:17,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:17,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:17,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:17,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:17,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:17,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:17,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:17,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,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:07:18,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:07:18,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:18,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:18,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:18,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:18,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:18,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:18,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:18,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:18,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,645 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:07:18,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:18,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:18,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:18,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:18,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:18,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:18,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:18,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:18,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:18,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:18,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:18,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:07:19,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:19,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:19,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 1] term [2020-10-15 18:07:19,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:19,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-15 18:07:19,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:19,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-15 18:07:19,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,271 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-15 18:07:20,377 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-15 18:07:20,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:20,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:20,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:20,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:20,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:20,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:21,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:21,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:21,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:21,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:21,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:21,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:21,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:21,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:21,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:21,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:07:21,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:21,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:07:21,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:07:21,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:21,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:07:21,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:07:21,635 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-15 18:07:21,777 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-15 18:07:21,795 INFO L132 LiptonReduction]: Checked pairs total: 8601 [2020-10-15 18:07:21,795 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-15 18:07:21,803 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2020-10-15 18:07:22,302 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6912 states. [2020-10-15 18:07:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states. [2020-10-15 18:07:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 18:07:22,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:22,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 18:07:22,312 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1156621551, now seen corresponding path program 1 times [2020-10-15 18:07:22,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:22,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672024516] [2020-10-15 18:07:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:22,569 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:07:22,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672024516] [2020-10-15 18:07:22,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:22,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:07:22,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199966876] [2020-10-15 18:07:22,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:07:22,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:22,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:07:22,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:07:22,595 INFO L87 Difference]: Start difference. First operand 6912 states. Second operand 3 states. [2020-10-15 18:07:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:22,765 INFO L93 Difference]: Finished difference Result 5762 states and 23320 transitions. [2020-10-15 18:07:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:07:22,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 18:07:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:22,830 INFO L225 Difference]: With dead ends: 5762 [2020-10-15 18:07:22,830 INFO L226 Difference]: Without dead ends: 4862 [2020-10-15 18:07:22,832 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:07:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-10-15 18:07:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2020-10-15 18:07:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4862 states. [2020-10-15 18:07:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2020-10-15 18:07:23,138 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 5 [2020-10-15 18:07:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:23,138 INFO L481 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2020-10-15 18:07:23,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:07:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2020-10-15 18:07:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:07:23,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:23,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:23,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:07:23,144 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:23,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash 398865326, now seen corresponding path program 1 times [2020-10-15 18:07:23,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:23,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925383481] [2020-10-15 18:07:23,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:23,400 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:07:23,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925383481] [2020-10-15 18:07:23,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:23,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:07:23,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835102240] [2020-10-15 18:07:23,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:07:23,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:07:23,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:07:23,406 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand 5 states. [2020-10-15 18:07:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:23,592 INFO L93 Difference]: Finished difference Result 5162 states and 20060 transitions. [2020-10-15 18:07:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:07:23,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:07:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:23,642 INFO L225 Difference]: With dead ends: 5162 [2020-10-15 18:07:23,642 INFO L226 Difference]: Without dead ends: 4262 [2020-10-15 18:07:23,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2020-10-15 18:07:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2020-10-15 18:07:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4262 states. [2020-10-15 18:07:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 16820 transitions. [2020-10-15 18:07:23,947 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 16820 transitions. Word has length 12 [2020-10-15 18:07:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:23,950 INFO L481 AbstractCegarLoop]: Abstraction has 4262 states and 16820 transitions. [2020-10-15 18:07:23,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:07:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 16820 transitions. [2020-10-15 18:07:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:07:23,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:23,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:23,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:07:23,956 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1998699831, now seen corresponding path program 1 times [2020-10-15 18:07:23,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:23,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029700908] [2020-10-15 18:07:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:24,083 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:07:24,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029700908] [2020-10-15 18:07:24,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:24,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:07:24,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485368557] [2020-10-15 18:07:24,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:07:24,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:07:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:07:24,085 INFO L87 Difference]: Start difference. First operand 4262 states and 16820 transitions. Second operand 4 states. [2020-10-15 18:07:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:24,167 INFO L93 Difference]: Finished difference Result 4462 states and 17190 transitions. [2020-10-15 18:07:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:07:24,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 18:07:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:24,201 INFO L225 Difference]: With dead ends: 4462 [2020-10-15 18:07:24,201 INFO L226 Difference]: Without dead ends: 3862 [2020-10-15 18:07:24,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:07:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2020-10-15 18:07:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3862. [2020-10-15 18:07:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2020-10-15 18:07:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 15080 transitions. [2020-10-15 18:07:24,332 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 15080 transitions. Word has length 14 [2020-10-15 18:07:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:24,333 INFO L481 AbstractCegarLoop]: Abstraction has 3862 states and 15080 transitions. [2020-10-15 18:07:24,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:07:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 15080 transitions. [2020-10-15 18:07:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:07:24,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:24,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:24,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:07:24,338 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash 904124147, now seen corresponding path program 1 times [2020-10-15 18:07:24,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:24,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816148125] [2020-10-15 18:07:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:24,481 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:07:24,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816148125] [2020-10-15 18:07:24,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:24,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:07:24,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425199462] [2020-10-15 18:07:24,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:07:24,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:07:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:07:24,483 INFO L87 Difference]: Start difference. First operand 3862 states and 15080 transitions. Second operand 5 states. [2020-10-15 18:07:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:24,663 INFO L93 Difference]: Finished difference Result 4238 states and 16212 transitions. [2020-10-15 18:07:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:07:24,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-15 18:07:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:24,681 INFO L225 Difference]: With dead ends: 4238 [2020-10-15 18:07:24,681 INFO L226 Difference]: Without dead ends: 3838 [2020-10-15 18:07:24,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:07:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2020-10-15 18:07:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3838. [2020-10-15 18:07:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3838 states. [2020-10-15 18:07:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 14960 transitions. [2020-10-15 18:07:24,808 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 14960 transitions. Word has length 16 [2020-10-15 18:07:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:24,808 INFO L481 AbstractCegarLoop]: Abstraction has 3838 states and 14960 transitions. [2020-10-15 18:07:24,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:07:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 14960 transitions. [2020-10-15 18:07:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:07:24,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:24,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:24,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:07:24,817 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:24,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2036781101, now seen corresponding path program 1 times [2020-10-15 18:07:24,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:24,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56143290] [2020-10-15 18:07:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:25,016 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:07:25,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56143290] [2020-10-15 18:07:25,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:25,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:07:25,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270128271] [2020-10-15 18:07:25,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:07:25,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:25,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:07:25,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:07:25,018 INFO L87 Difference]: Start difference. First operand 3838 states and 14960 transitions. Second operand 6 states. [2020-10-15 18:07:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:25,235 INFO L93 Difference]: Finished difference Result 4110 states and 15720 transitions. [2020-10-15 18:07:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:07:25,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 18:07:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:25,258 INFO L225 Difference]: With dead ends: 4110 [2020-10-15 18:07:25,258 INFO L226 Difference]: Without dead ends: 3790 [2020-10-15 18:07:25,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:07:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2020-10-15 18:07:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 3790. [2020-10-15 18:07:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2020-10-15 18:07:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 14720 transitions. [2020-10-15 18:07:25,383 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 14720 transitions. Word has length 17 [2020-10-15 18:07:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:25,383 INFO L481 AbstractCegarLoop]: Abstraction has 3790 states and 14720 transitions. [2020-10-15 18:07:25,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:07:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 14720 transitions. [2020-10-15 18:07:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:07:25,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:25,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:25,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:07:25,517 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1561823884, now seen corresponding path program 1 times [2020-10-15 18:07:25,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:25,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280705647] [2020-10-15 18:07:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:25,723 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:07:25,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280705647] [2020-10-15 18:07:25,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:25,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:07:25,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446171220] [2020-10-15 18:07:25,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:07:25,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:07:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:07:25,726 INFO L87 Difference]: Start difference. First operand 3790 states and 14720 transitions. Second operand 6 states. [2020-10-15 18:07:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:25,958 INFO L93 Difference]: Finished difference Result 4170 states and 16052 transitions. [2020-10-15 18:07:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:07:25,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-15 18:07:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:25,978 INFO L225 Difference]: With dead ends: 4170 [2020-10-15 18:07:25,978 INFO L226 Difference]: Without dead ends: 3970 [2020-10-15 18:07:25,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:07:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. [2020-10-15 18:07:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 3970. [2020-10-15 18:07:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3970 states. [2020-10-15 18:07:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 15446 transitions. [2020-10-15 18:07:26,128 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 15446 transitions. Word has length 18 [2020-10-15 18:07:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:26,128 INFO L481 AbstractCegarLoop]: Abstraction has 3970 states and 15446 transitions. [2020-10-15 18:07:26,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:07:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 15446 transitions. [2020-10-15 18:07:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:07:26,136 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:26,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:26,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:07:26,136 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1282838580, now seen corresponding path program 1 times [2020-10-15 18:07:26,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:26,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450465733] [2020-10-15 18:07:26,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:26,443 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:07:26,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450465733] [2020-10-15 18:07:26,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:26,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:07:26,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517415692] [2020-10-15 18:07:26,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:07:26,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:26,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:07:26,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:07:26,447 INFO L87 Difference]: Start difference. First operand 3970 states and 15446 transitions. Second operand 6 states. [2020-10-15 18:07:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:26,692 INFO L93 Difference]: Finished difference Result 5162 states and 19926 transitions. [2020-10-15 18:07:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:07:26,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-15 18:07:26,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:26,710 INFO L225 Difference]: With dead ends: 5162 [2020-10-15 18:07:26,710 INFO L226 Difference]: Without dead ends: 4782 [2020-10-15 18:07:26,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:07:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2020-10-15 18:07:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4526. [2020-10-15 18:07:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4526 states. [2020-10-15 18:07:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 17536 transitions. [2020-10-15 18:07:26,869 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 17536 transitions. Word has length 18 [2020-10-15 18:07:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:26,869 INFO L481 AbstractCegarLoop]: Abstraction has 4526 states and 17536 transitions. [2020-10-15 18:07:26,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:07:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 17536 transitions. [2020-10-15 18:07:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:07:26,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:26,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:26,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:07:26,880 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash 433694708, now seen corresponding path program 1 times [2020-10-15 18:07:26,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:26,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696753597] [2020-10-15 18:07:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:27,066 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:07:27,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696753597] [2020-10-15 18:07:27,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:27,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:07:27,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342027303] [2020-10-15 18:07:27,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:07:27,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:07:27,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:27,068 INFO L87 Difference]: Start difference. First operand 4526 states and 17536 transitions. Second operand 7 states. [2020-10-15 18:07:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:27,373 INFO L93 Difference]: Finished difference Result 4718 states and 18096 transitions. [2020-10-15 18:07:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:07:27,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-15 18:07:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:27,393 INFO L225 Difference]: With dead ends: 4718 [2020-10-15 18:07:27,393 INFO L226 Difference]: Without dead ends: 4542 [2020-10-15 18:07:27,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:07:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2020-10-15 18:07:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4494. [2020-10-15 18:07:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4494 states. [2020-10-15 18:07:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 4494 states and 17392 transitions. [2020-10-15 18:07:27,530 INFO L78 Accepts]: Start accepts. Automaton has 4494 states and 17392 transitions. Word has length 19 [2020-10-15 18:07:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:27,531 INFO L481 AbstractCegarLoop]: Abstraction has 4494 states and 17392 transitions. [2020-10-15 18:07:27,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:07:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 17392 transitions. [2020-10-15 18:07:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:07:27,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:27,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:27,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:07:27,541 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:27,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1114902060, now seen corresponding path program 1 times [2020-10-15 18:07:27,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:27,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026577476] [2020-10-15 18:07:27,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:27,796 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:07:27,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026577476] [2020-10-15 18:07:27,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:27,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:07:27,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652746584] [2020-10-15 18:07:27,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:07:27,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:07:27,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:27,800 INFO L87 Difference]: Start difference. First operand 4494 states and 17392 transitions. Second operand 7 states. [2020-10-15 18:07:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:28,118 INFO L93 Difference]: Finished difference Result 4926 states and 18808 transitions. [2020-10-15 18:07:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:07:28,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-15 18:07:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:28,135 INFO L225 Difference]: With dead ends: 4926 [2020-10-15 18:07:28,135 INFO L226 Difference]: Without dead ends: 4710 [2020-10-15 18:07:28,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:07:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2020-10-15 18:07:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 4446. [2020-10-15 18:07:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4446 states. [2020-10-15 18:07:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4446 states to 4446 states and 17152 transitions. [2020-10-15 18:07:28,255 INFO L78 Accepts]: Start accepts. Automaton has 4446 states and 17152 transitions. Word has length 19 [2020-10-15 18:07:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:28,256 INFO L481 AbstractCegarLoop]: Abstraction has 4446 states and 17152 transitions. [2020-10-15 18:07:28,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:07:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4446 states and 17152 transitions. [2020-10-15 18:07:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:07:28,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:28,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:28,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:07:28,266 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:28,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1160883988, now seen corresponding path program 1 times [2020-10-15 18:07:28,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:28,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776534904] [2020-10-15 18:07:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:28,352 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:07:28,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776534904] [2020-10-15 18:07:28,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:28,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:07:28,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250836441] [2020-10-15 18:07:28,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:07:28,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:28,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:07:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:07:28,355 INFO L87 Difference]: Start difference. First operand 4446 states and 17152 transitions. Second operand 5 states. [2020-10-15 18:07:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:28,431 INFO L93 Difference]: Finished difference Result 6622 states and 25165 transitions. [2020-10-15 18:07:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:07:28,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-15 18:07:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:28,444 INFO L225 Difference]: With dead ends: 6622 [2020-10-15 18:07:28,444 INFO L226 Difference]: Without dead ends: 4374 [2020-10-15 18:07:28,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4374 states. [2020-10-15 18:07:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4374 to 4086. [2020-10-15 18:07:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2020-10-15 18:07:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 14970 transitions. [2020-10-15 18:07:28,553 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 14970 transitions. Word has length 19 [2020-10-15 18:07:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:28,553 INFO L481 AbstractCegarLoop]: Abstraction has 4086 states and 14970 transitions. [2020-10-15 18:07:28,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:07:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 14970 transitions. [2020-10-15 18:07:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:07:28,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:28,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:28,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:07:28,561 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash -163786732, now seen corresponding path program 2 times [2020-10-15 18:07:28,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:28,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256117667] [2020-10-15 18:07:28,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:28,609 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:07:28,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256117667] [2020-10-15 18:07:28,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:28,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:07:28,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460394046] [2020-10-15 18:07:28,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:07:28,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:28,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:07:28,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:07:28,611 INFO L87 Difference]: Start difference. First operand 4086 states and 14970 transitions. Second operand 4 states. [2020-10-15 18:07:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:28,655 INFO L93 Difference]: Finished difference Result 4074 states and 13562 transitions. [2020-10-15 18:07:28,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:07:28,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-15 18:07:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:28,664 INFO L225 Difference]: With dead ends: 4074 [2020-10-15 18:07:28,664 INFO L226 Difference]: Without dead ends: 3018 [2020-10-15 18:07:28,664 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:07:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-10-15 18:07:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2020-10-15 18:07:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-15 18:07:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 9886 transitions. [2020-10-15 18:07:28,750 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 9886 transitions. Word has length 19 [2020-10-15 18:07:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:28,750 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 9886 transitions. [2020-10-15 18:07:28,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:07:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 9886 transitions. [2020-10-15 18:07:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:07:28,759 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:28,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:28,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:07:28,759 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2043823519, now seen corresponding path program 1 times [2020-10-15 18:07:28,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:28,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865211842] [2020-10-15 18:07:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:28,969 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:07:28,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865211842] [2020-10-15 18:07:28,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:28,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:07:28,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362138451] [2020-10-15 18:07:28,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:07:28,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:07:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:07:28,971 INFO L87 Difference]: Start difference. First operand 3018 states and 9886 transitions. Second operand 5 states. [2020-10-15 18:07:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:29,021 INFO L93 Difference]: Finished difference Result 2496 states and 7575 transitions. [2020-10-15 18:07:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:07:29,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-15 18:07:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:29,027 INFO L225 Difference]: With dead ends: 2496 [2020-10-15 18:07:29,027 INFO L226 Difference]: Without dead ends: 1910 [2020-10-15 18:07:29,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2020-10-15 18:07:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1910. [2020-10-15 18:07:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2020-10-15 18:07:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 5682 transitions. [2020-10-15 18:07:29,069 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 5682 transitions. Word has length 20 [2020-10-15 18:07:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:29,069 INFO L481 AbstractCegarLoop]: Abstraction has 1910 states and 5682 transitions. [2020-10-15 18:07:29,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:07:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 5682 transitions. [2020-10-15 18:07:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:07:29,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:29,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:29,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:07:29,075 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1258588165, now seen corresponding path program 1 times [2020-10-15 18:07:29,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:29,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443567649] [2020-10-15 18:07:29,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:29,237 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:07:29,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443567649] [2020-10-15 18:07:29,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:29,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:07:29,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931417351] [2020-10-15 18:07:29,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:07:29,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:29,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:07:29,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:07:29,239 INFO L87 Difference]: Start difference. First operand 1910 states and 5682 transitions. Second operand 8 states. [2020-10-15 18:07:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:29,630 INFO L93 Difference]: Finished difference Result 2026 states and 6033 transitions. [2020-10-15 18:07:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 18:07:29,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-15 18:07:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:29,636 INFO L225 Difference]: With dead ends: 2026 [2020-10-15 18:07:29,636 INFO L226 Difference]: Without dead ends: 2006 [2020-10-15 18:07:29,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:07:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2020-10-15 18:07:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1952. [2020-10-15 18:07:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2020-10-15 18:07:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5870 transitions. [2020-10-15 18:07:29,680 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5870 transitions. Word has length 23 [2020-10-15 18:07:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:29,681 INFO L481 AbstractCegarLoop]: Abstraction has 1952 states and 5870 transitions. [2020-10-15 18:07:29,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:07:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5870 transitions. [2020-10-15 18:07:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:07:29,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:29,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:29,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:07:29,687 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2093630789, now seen corresponding path program 1 times [2020-10-15 18:07:29,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:29,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339064276] [2020-10-15 18:07:29,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:29,794 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:07:29,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339064276] [2020-10-15 18:07:29,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:29,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:07:29,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389156085] [2020-10-15 18:07:29,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:07:29,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:07:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:07:29,796 INFO L87 Difference]: Start difference. First operand 1952 states and 5870 transitions. Second operand 6 states. [2020-10-15 18:07:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:29,861 INFO L93 Difference]: Finished difference Result 1724 states and 5169 transitions. [2020-10-15 18:07:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:07:29,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-15 18:07:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:29,865 INFO L225 Difference]: With dead ends: 1724 [2020-10-15 18:07:29,865 INFO L226 Difference]: Without dead ends: 1578 [2020-10-15 18:07:29,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:07:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2020-10-15 18:07:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1294. [2020-10-15 18:07:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2020-10-15 18:07:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3918 transitions. [2020-10-15 18:07:29,894 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3918 transitions. Word has length 23 [2020-10-15 18:07:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:29,895 INFO L481 AbstractCegarLoop]: Abstraction has 1294 states and 3918 transitions. [2020-10-15 18:07:29,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:07:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3918 transitions. [2020-10-15 18:07:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:07:29,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:29,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:29,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:07:29,898 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:29,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:29,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1542019689, now seen corresponding path program 1 times [2020-10-15 18:07:29,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:29,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757179848] [2020-10-15 18:07:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:29,987 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:07:29,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757179848] [2020-10-15 18:07:29,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:29,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:07:29,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991053043] [2020-10-15 18:07:29,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:07:29,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:29,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:07:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:07:29,989 INFO L87 Difference]: Start difference. First operand 1294 states and 3918 transitions. Second operand 5 states. [2020-10-15 18:07:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:30,043 INFO L93 Difference]: Finished difference Result 1696 states and 5001 transitions. [2020-10-15 18:07:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:07:30,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-15 18:07:30,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:30,046 INFO L225 Difference]: With dead ends: 1696 [2020-10-15 18:07:30,046 INFO L226 Difference]: Without dead ends: 1200 [2020-10-15 18:07:30,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-10-15 18:07:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1194. [2020-10-15 18:07:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2020-10-15 18:07:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 3461 transitions. [2020-10-15 18:07:30,072 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 3461 transitions. Word has length 26 [2020-10-15 18:07:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:30,072 INFO L481 AbstractCegarLoop]: Abstraction has 1194 states and 3461 transitions. [2020-10-15 18:07:30,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:07:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 3461 transitions. [2020-10-15 18:07:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:07:30,075 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:30,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:30,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:07:30,076 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash -935494531, now seen corresponding path program 2 times [2020-10-15 18:07:30,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:30,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157304422] [2020-10-15 18:07:30,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:30,168 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:07:30,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157304422] [2020-10-15 18:07:30,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:30,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:07:30,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088042173] [2020-10-15 18:07:30,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:07:30,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:07:30,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:30,171 INFO L87 Difference]: Start difference. First operand 1194 states and 3461 transitions. Second operand 7 states. [2020-10-15 18:07:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:30,250 INFO L93 Difference]: Finished difference Result 1152 states and 3377 transitions. [2020-10-15 18:07:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:07:30,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-10-15 18:07:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:30,252 INFO L225 Difference]: With dead ends: 1152 [2020-10-15 18:07:30,252 INFO L226 Difference]: Without dead ends: 591 [2020-10-15 18:07:30,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:07:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-10-15 18:07:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2020-10-15 18:07:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-15 18:07:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1734 transitions. [2020-10-15 18:07:30,264 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1734 transitions. Word has length 26 [2020-10-15 18:07:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:30,265 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 1734 transitions. [2020-10-15 18:07:30,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:07:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1734 transitions. [2020-10-15 18:07:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-15 18:07:30,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:30,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:30,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:07:30,267 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:30,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:30,267 INFO L82 PathProgramCache]: Analyzing trace with hash 167118430, now seen corresponding path program 1 times [2020-10-15 18:07:30,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:30,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153292085] [2020-10-15 18:07:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:30,344 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:07:30,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153292085] [2020-10-15 18:07:30,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:30,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:07:30,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063003350] [2020-10-15 18:07:30,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:07:30,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:30,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:07:30,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:07:30,346 INFO L87 Difference]: Start difference. First operand 591 states and 1734 transitions. Second operand 5 states. [2020-10-15 18:07:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:30,388 INFO L93 Difference]: Finished difference Result 702 states and 2034 transitions. [2020-10-15 18:07:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:07:30,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-15 18:07:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:30,389 INFO L225 Difference]: With dead ends: 702 [2020-10-15 18:07:30,389 INFO L226 Difference]: Without dead ends: 231 [2020-10-15 18:07:30,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:07:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-10-15 18:07:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2020-10-15 18:07:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-15 18:07:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 582 transitions. [2020-10-15 18:07:30,394 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 582 transitions. Word has length 30 [2020-10-15 18:07:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:30,394 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 582 transitions. [2020-10-15 18:07:30,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:07:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 582 transitions. [2020-10-15 18:07:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-15 18:07:30,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:30,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:30,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:07:30,395 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash -350706914, now seen corresponding path program 2 times [2020-10-15 18:07:30,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:30,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372930529] [2020-10-15 18:07:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:07:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:07:30,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372930529] [2020-10-15 18:07:30,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:07:30,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:07:30,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736967888] [2020-10-15 18:07:30,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:07:30,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:07:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:07:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:07:30,711 INFO L87 Difference]: Start difference. First operand 231 states and 582 transitions. Second operand 9 states. [2020-10-15 18:07:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:07:30,910 INFO L93 Difference]: Finished difference Result 306 states and 771 transitions. [2020-10-15 18:07:30,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:07:30,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-15 18:07:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:07:30,914 INFO L225 Difference]: With dead ends: 306 [2020-10-15 18:07:30,914 INFO L226 Difference]: Without dead ends: 223 [2020-10-15 18:07:30,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:07:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-10-15 18:07:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2020-10-15 18:07:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-15 18:07:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 434 transitions. [2020-10-15 18:07:30,918 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 434 transitions. Word has length 30 [2020-10-15 18:07:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:07:30,919 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 434 transitions. [2020-10-15 18:07:30,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:07:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 434 transitions. [2020-10-15 18:07:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-15 18:07:30,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:07:30,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:07:30,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:07:30,920 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:07:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:07:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash -335085538, now seen corresponding path program 3 times [2020-10-15 18:07:30,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:07:30,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400751751] [2020-10-15 18:07:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:07:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:07:31,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:07:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:07:31,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:07:31,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:07:31,206 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:07:31,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:07:31,252 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:07:31,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,253 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:07:31,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,254 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:07:31,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,254 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:07:31,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,255 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:07:31,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,255 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:07:31,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,259 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:07:31,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,260 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:07:31,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,260 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:07:31,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,260 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:07:31,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,261 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:07:31,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,261 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:07:31,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,262 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:07:31,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,262 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:07:31,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,262 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:07:31,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,263 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:07:31,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,263 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:07:31,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,263 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:07:31,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,263 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:07:31,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,268 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:07:31,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,269 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:07:31,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,269 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:07:31,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,269 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:07:31,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,270 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:07:31,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,270 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:07:31,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,271 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:07:31,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,271 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:07:31,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,271 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:07:31,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,271 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:07:31,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,272 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:07:31,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,272 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:07:31,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,272 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:07:31,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,273 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:07:31,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,273 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:07:31,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,273 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:07:31,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,273 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:07:31,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,274 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:07:31,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,274 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:07:31,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,274 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:07:31,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,275 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:07:31,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,275 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:07:31,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:07:31,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:07:31 BasicIcfg [2020-10-15 18:07:31,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:07:31,401 INFO L168 Benchmark]: Toolchain (without parser) took 17699.70 ms. Allocated memory was 259.0 MB in the beginning and 793.8 MB in the end (delta: 534.8 MB). Free memory was 214.1 MB in the beginning and 613.3 MB in the end (delta: -399.2 MB). Peak memory consumption was 135.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:07:31,403 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 259.0 MB. Free memory was 237.1 MB in the beginning and 236.2 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-15 18:07:31,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.19 ms. Allocated memory was 259.0 MB in the beginning and 333.4 MB in the end (delta: 74.4 MB). Free memory was 214.1 MB in the beginning and 282.6 MB in the end (delta: -68.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:07:31,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.16 ms. Allocated memory is still 333.4 MB. Free memory was 282.6 MB in the beginning and 279.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:07:31,405 INFO L168 Benchmark]: Boogie Preprocessor took 40.95 ms. Allocated memory is still 333.4 MB. Free memory was 279.2 MB in the beginning and 276.7 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:07:31,405 INFO L168 Benchmark]: RCFGBuilder took 2344.07 ms. Allocated memory was 333.4 MB in the beginning and 375.4 MB in the end (delta: 41.9 MB). Free memory was 276.7 MB in the beginning and 332.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 136.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:07:31,409 INFO L168 Benchmark]: TraceAbstraction took 14433.72 ms. Allocated memory was 375.4 MB in the beginning and 793.8 MB in the end (delta: 418.4 MB). Free memory was 332.9 MB in the beginning and 613.3 MB in the end (delta: -280.4 MB). Peak memory consumption was 137.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:07:31,412 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 259.0 MB. Free memory was 237.1 MB in the beginning and 236.2 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 803.19 ms. Allocated memory was 259.0 MB in the beginning and 333.4 MB in the end (delta: 74.4 MB). Free memory was 214.1 MB in the beginning and 282.6 MB in the end (delta: -68.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 72.16 ms. Allocated memory is still 333.4 MB. Free memory was 282.6 MB in the beginning and 279.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.95 ms. Allocated memory is still 333.4 MB. Free memory was 279.2 MB in the beginning and 276.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2344.07 ms. Allocated memory was 333.4 MB in the beginning and 375.4 MB in the end (delta: 41.9 MB). Free memory was 276.7 MB in the beginning and 332.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 136.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 14433.72 ms. Allocated memory was 375.4 MB in the beginning and 793.8 MB in the end (delta: 418.4 MB). Free memory was 332.9 MB in the beginning and 613.3 MB in the end (delta: -280.4 MB). Peak memory consumption was 137.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1908 VarBasedMoverChecksPositive, 99 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 334 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.6s, 126 PlacesBefore, 49 PlacesAfterwards, 115 TransitionsBefore, 37 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 8601 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd4; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd4; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L847] 0 pthread_t t145; [L848] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] 0 pthread_t t146; [L850] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t147; [L852] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t148; [L854] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L7] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L773] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L793] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L796] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L806] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L816] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L819] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L822] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L743] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L746] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L749] 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) [L749] 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) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 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 [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 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 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L829] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L779] 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) [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L779] 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) [L779] 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) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 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 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L832] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 4 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=1] [L3] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L871] 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) [L871] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] EXPR 0 !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) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] EXPR 0 !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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=1] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 668 SDtfs, 1327 SDslu, 1661 SDs, 0 SdLazy, 624 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 1236 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 63415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...