/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/safe019_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:35:08,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:35:08,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:35:08,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:35:08,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:35:08,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:35:08,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:35:08,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:35:08,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:35:08,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:35:08,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:35:08,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:35:08,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:35:08,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:35:08,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:35:08,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:35:08,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:35:08,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:35:08,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:35:08,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:35:08,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:35:08,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:35:08,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:35:08,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:35:08,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:35:08,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:35:08,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:35:08,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:35:08,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:35:08,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:35:08,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:35:08,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:35:08,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:35:08,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:35:08,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:35:08,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:35:08,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:35:08,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:35:08,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:35:08,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:35:08,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:35:08,693 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:35:08,715 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:35:08,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:35:08,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:35:08,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:35:08,717 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:35:08,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:35:08,718 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:35:08,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:35:08,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:35:08,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:35:08,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:35:08,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:35:08,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:35:08,719 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:35:08,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:35:08,719 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:35:08,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:35:08,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:35:08,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:35:08,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:35:08,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:35:08,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:35:08,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:35:08,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:35:08,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:35:08,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:35:08,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:35:08,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:35:08,722 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:35:08,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:35:09,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:35:09,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:35:09,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:35:09,017 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:35:09,018 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:35:09,019 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2020-10-15 18:35:09,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5d2e6d5/945485031dd24f74a74886dae8141b7b/FLAG74c10b265 [2020-10-15 18:35:09,655 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:35:09,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2020-10-15 18:35:09,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5d2e6d5/945485031dd24f74a74886dae8141b7b/FLAG74c10b265 [2020-10-15 18:35:09,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5d2e6d5/945485031dd24f74a74886dae8141b7b [2020-10-15 18:35:09,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:35:09,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:35:09,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:35:09,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:35:09,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:35:09,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:35:09" (1/1) ... [2020-10-15 18:35:09,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a2f407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:09, skipping insertion in model container [2020-10-15 18:35:09,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:35:09" (1/1) ... [2020-10-15 18:35:09,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:35:10,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:35:10,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:35:10,636 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:35:10,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:35:10,795 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:35:10,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10 WrapperNode [2020-10-15 18:35:10,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:35:10,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:35:10,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:35:10,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:35:10,805 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:35:10" (1/1) ... [2020-10-15 18:35:10,828 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:35:10" (1/1) ... [2020-10-15 18:35:10,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:35:10,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:35:10,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:35:10,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:35:10,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (1/1) ... [2020-10-15 18:35:10,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (1/1) ... [2020-10-15 18:35:10,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (1/1) ... [2020-10-15 18:35:10,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (1/1) ... [2020-10-15 18:35:10,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (1/1) ... [2020-10-15 18:35:10,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (1/1) ... [2020-10-15 18:35:10,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (1/1) ... [2020-10-15 18:35:10,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:35:10,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:35:10,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:35:10,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:35:10,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (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:35:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 18:35:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:35:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:35:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:35:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:35:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:35:10,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:35:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:35:10,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:35:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:35:10,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:35:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:35:10,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:35:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-15 18:35:10,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:35:10,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:35:10,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:35:10,987 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:35:14,382 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:35:14,383 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:35:14,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:35:14 BoogieIcfgContainer [2020-10-15 18:35:14,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:35:14,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:35:14,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:35:14,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:35:14,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:35:09" (1/3) ... [2020-10-15 18:35:14,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531dbd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:35:14, skipping insertion in model container [2020-10-15 18:35:14,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:35:10" (2/3) ... [2020-10-15 18:35:14,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531dbd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:35:14, skipping insertion in model container [2020-10-15 18:35:14,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:35:14" (3/3) ... [2020-10-15 18:35:14,396 INFO L111 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2020-10-15 18:35:14,407 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:35:14,407 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:35:14,413 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:35:14,414 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:35:14,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,481 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,489 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,489 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,497 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,497 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,513 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,514 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:35:14,541 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:35:14,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:35:14,560 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:35:14,561 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:35:14,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:35:14,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:35:14,561 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:35:14,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:35:14,561 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:35:14,574 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:35:14,577 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 272 flow [2020-10-15 18:35:14,580 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 272 flow [2020-10-15 18:35:14,581 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2020-10-15 18:35:14,636 INFO L129 PetriNetUnfolder]: 2/122 cut-off events. [2020-10-15 18:35:14,637 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:35:14,641 INFO L80 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-15 18:35:14,645 INFO L117 LiptonReduction]: Number of co-enabled transitions 2274 [2020-10-15 18:35:15,109 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-15 18:35:15,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:15,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:15,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:15,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:15,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:15,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:15,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:15,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:15,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:15,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:15,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:15,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:15,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:15,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:15,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:15,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:15,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:15,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:15,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:15,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:15,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:35:15,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:35:15,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:15,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:15,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:15,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:15,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:19,772 WARN L193 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2020-10-15 18:35:19,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:19,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:19,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 4, 3, 2, 1] term [2020-10-15 18:35:19,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:19,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-15 18:35:19,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:19,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 3, 2, 1] term [2020-10-15 18:35:19,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:19,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 3, 2, 1] term [2020-10-15 18:35:19,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:19,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:19,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,313 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 198 DAG size of output: 174 [2020-10-15 18:35:21,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:35:21,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:35:21,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:21,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:21,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:21,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:21,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:21,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:21,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:21,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:21,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:21,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:21,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:21,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:21,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:21,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:35:21,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:35:21,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:21,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:21,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:21,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:21,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:21,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:21,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:21,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:21,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:21,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:21,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:21,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:21,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:21,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:21,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:21,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:21,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:22,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:22,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:22,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:35:22,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:35:22,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:22,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-15 18:35:22,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:35:22,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-15 18:35:22,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-15 18:35:22,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-15 18:35:22,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 3, 5, 3, 3, 2, 3, 4, 3, 2, 1] term [2020-10-15 18:35:22,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 4, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 4, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-15 18:35:22,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 18:35:22,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-15 18:35:22,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 18:35:22,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-15 18:35:22,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 18:35:22,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 2, 5, 3, 3, 4, 3, 4, 3, 2, 1] term [2020-10-15 18:35:22,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 4, 4, 4, 3, 4, 3, 2, 1] term [2020-10-15 18:35:22,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 4, 4, 4, 3, 4, 3, 2, 1] term [2020-10-15 18:35:22,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:35:22,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:35:22,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:22,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:22,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:35:22,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:35:22,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:35:22,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:35:22,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:35:22,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:35:22,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:22,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:22,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:35:22,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:22,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-15 18:35:22,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:22,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:22,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:22,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:22,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,150 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-15 18:35:23,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:23,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:23,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,260 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-15 18:35:23,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,824 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-15 18:35:23,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:23,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:23,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:24,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:24,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:24,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:24,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,863 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-10-15 18:35:24,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:24,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:24,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:24,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-15 18:35:25,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 4, 2, 2, 2, 1] term [2020-10-15 18:35:25,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 2, 2, 2, 1] term [2020-10-15 18:35:25,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-15 18:35:25,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-15 18:35:25,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-15 18:35:25,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-15 18:35:25,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-15 18:35:25,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:35:25,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,610 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-15 18:35:25,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:25,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:25,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:25,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,232 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-15 18:35:26,352 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-15 18:35:26,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:26,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:26,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:26,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-15 18:35:26,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:26,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:26,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-15 18:35:26,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:26,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:35:26,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:35:27,024 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 142 [2020-10-15 18:35:27,274 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-10-15 18:35:27,281 INFO L132 LiptonReduction]: Checked pairs total: 5605 [2020-10-15 18:35:27,281 INFO L134 LiptonReduction]: Total number of compositions: 107 [2020-10-15 18:35:27,288 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-10-15 18:35:27,412 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2250 states. [2020-10-15 18:35:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states. [2020-10-15 18:35:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 18:35:27,420 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:27,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 18:35:27,421 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:35:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1760210776, now seen corresponding path program 1 times [2020-10-15 18:35:27,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:27,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166996249] [2020-10-15 18:35:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:27,688 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:35:27,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166996249] [2020-10-15 18:35:27,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:27,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:35:27,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501734336] [2020-10-15 18:35:27,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:35:27,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:27,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:35:27,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:35:27,713 INFO L87 Difference]: Start difference. First operand 2250 states. Second operand 3 states. [2020-10-15 18:35:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:27,890 INFO L93 Difference]: Finished difference Result 1802 states and 6784 transitions. [2020-10-15 18:35:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:35:27,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 18:35:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:27,935 INFO L225 Difference]: With dead ends: 1802 [2020-10-15 18:35:27,936 INFO L226 Difference]: Without dead ends: 1482 [2020-10-15 18:35:27,937 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:35:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-10-15 18:35:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2020-10-15 18:35:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2020-10-15 18:35:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 5488 transitions. [2020-10-15 18:35:28,088 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 5488 transitions. Word has length 5 [2020-10-15 18:35:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:28,088 INFO L481 AbstractCegarLoop]: Abstraction has 1482 states and 5488 transitions. [2020-10-15 18:35:28,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:35:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 5488 transitions. [2020-10-15 18:35:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:35:28,091 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:28,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:35:28,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:35:28,091 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:35:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash -900431533, now seen corresponding path program 1 times [2020-10-15 18:35:28,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:28,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497058864] [2020-10-15 18:35:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:28,170 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:35:28,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497058864] [2020-10-15 18:35:28,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:28,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:35:28,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438575838] [2020-10-15 18:35:28,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:35:28,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:28,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:35:28,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:35:28,173 INFO L87 Difference]: Start difference. First operand 1482 states and 5488 transitions. Second operand 3 states. [2020-10-15 18:35:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:28,198 INFO L93 Difference]: Finished difference Result 1450 states and 5344 transitions. [2020-10-15 18:35:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:35:28,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 18:35:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:28,211 INFO L225 Difference]: With dead ends: 1450 [2020-10-15 18:35:28,212 INFO L226 Difference]: Without dead ends: 1450 [2020-10-15 18:35:28,213 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:35:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-15 18:35:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-15 18:35:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-15 18:35:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5344 transitions. [2020-10-15 18:35:28,263 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5344 transitions. Word has length 11 [2020-10-15 18:35:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:28,264 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 5344 transitions. [2020-10-15 18:35:28,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:35:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5344 transitions. [2020-10-15 18:35:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:35:28,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:28,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:35:28,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:35:28,268 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:35:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2143609046, now seen corresponding path program 1 times [2020-10-15 18:35:28,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:28,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968182180] [2020-10-15 18:35:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:28,333 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:35:28,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968182180] [2020-10-15 18:35:28,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:28,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:35:28,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710213002] [2020-10-15 18:35:28,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:35:28,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:35:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:35:28,336 INFO L87 Difference]: Start difference. First operand 1450 states and 5344 transitions. Second operand 3 states. [2020-10-15 18:35:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:28,361 INFO L93 Difference]: Finished difference Result 1378 states and 5038 transitions. [2020-10-15 18:35:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:35:28,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 18:35:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:28,373 INFO L225 Difference]: With dead ends: 1378 [2020-10-15 18:35:28,374 INFO L226 Difference]: Without dead ends: 1378 [2020-10-15 18:35:28,374 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:35:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-10-15 18:35:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2020-10-15 18:35:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2020-10-15 18:35:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 5038 transitions. [2020-10-15 18:35:28,421 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 5038 transitions. Word has length 12 [2020-10-15 18:35:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:28,422 INFO L481 AbstractCegarLoop]: Abstraction has 1378 states and 5038 transitions. [2020-10-15 18:35:28,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:35:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 5038 transitions. [2020-10-15 18:35:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:35:28,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:28,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:35:28,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:35:28,426 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:35:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash 100525783, now seen corresponding path program 1 times [2020-10-15 18:35:28,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:28,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838675874] [2020-10-15 18:35:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:28,520 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:35:28,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838675874] [2020-10-15 18:35:28,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:28,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:35:28,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18444178] [2020-10-15 18:35:28,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:35:28,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:28,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:35:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:35:28,522 INFO L87 Difference]: Start difference. First operand 1378 states and 5038 transitions. Second operand 4 states. [2020-10-15 18:35:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:28,580 INFO L93 Difference]: Finished difference Result 2098 states and 7582 transitions. [2020-10-15 18:35:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:35:28,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-15 18:35:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:28,591 INFO L225 Difference]: With dead ends: 2098 [2020-10-15 18:35:28,591 INFO L226 Difference]: Without dead ends: 1228 [2020-10-15 18:35:28,591 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:35:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-10-15 18:35:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2020-10-15 18:35:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2020-10-15 18:35:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 4462 transitions. [2020-10-15 18:35:28,628 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 4462 transitions. Word has length 13 [2020-10-15 18:35:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:28,629 INFO L481 AbstractCegarLoop]: Abstraction has 1228 states and 4462 transitions. [2020-10-15 18:35:28,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:35:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 4462 transitions. [2020-10-15 18:35:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:35:28,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:28,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:35:28,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:35:28,630 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:35:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2027412051, now seen corresponding path program 2 times [2020-10-15 18:35:28,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:28,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053280482] [2020-10-15 18:35:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:28,760 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:35:28,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053280482] [2020-10-15 18:35:28,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:28,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:35:28,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488266532] [2020-10-15 18:35:28,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:35:28,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:35:28,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:35:28,766 INFO L87 Difference]: Start difference. First operand 1228 states and 4462 transitions. Second operand 3 states. [2020-10-15 18:35:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:28,791 INFO L93 Difference]: Finished difference Result 1192 states and 4315 transitions. [2020-10-15 18:35:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:35:28,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 18:35:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:28,803 INFO L225 Difference]: With dead ends: 1192 [2020-10-15 18:35:28,803 INFO L226 Difference]: Without dead ends: 1192 [2020-10-15 18:35:28,804 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:35:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-10-15 18:35:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2020-10-15 18:35:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2020-10-15 18:35:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 4315 transitions. [2020-10-15 18:35:28,839 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 4315 transitions. Word has length 13 [2020-10-15 18:35:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:28,840 INFO L481 AbstractCegarLoop]: Abstraction has 1192 states and 4315 transitions. [2020-10-15 18:35:28,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:35:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 4315 transitions. [2020-10-15 18:35:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:35:28,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:28,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:35:28,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:35:28,842 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:35:28,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1574705365, now seen corresponding path program 1 times [2020-10-15 18:35:28,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:28,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385478344] [2020-10-15 18:35:28,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:29,223 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:35:29,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385478344] [2020-10-15 18:35:29,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:29,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:35:29,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880748170] [2020-10-15 18:35:29,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:35:29,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:29,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:35:29,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:35:29,226 INFO L87 Difference]: Start difference. First operand 1192 states and 4315 transitions. Second operand 8 states. [2020-10-15 18:35:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:29,595 INFO L93 Difference]: Finished difference Result 1356 states and 4927 transitions. [2020-10-15 18:35:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:35:29,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-15 18:35:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:29,608 INFO L225 Difference]: With dead ends: 1356 [2020-10-15 18:35:29,608 INFO L226 Difference]: Without dead ends: 1356 [2020-10-15 18:35:29,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:35:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-10-15 18:35:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1208. [2020-10-15 18:35:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2020-10-15 18:35:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 4325 transitions. [2020-10-15 18:35:29,657 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 4325 transitions. Word has length 14 [2020-10-15 18:35:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:29,658 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 4325 transitions. [2020-10-15 18:35:29,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:35:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 4325 transitions. [2020-10-15 18:35:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:35:29,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:29,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:35:29,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:35:29,662 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:35:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash -65659995, now seen corresponding path program 1 times [2020-10-15 18:35:29,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:29,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120493469] [2020-10-15 18:35:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:29,806 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:35:29,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120493469] [2020-10-15 18:35:29,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:29,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:35:29,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786071160] [2020-10-15 18:35:29,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:35:29,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:29,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:35:29,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:35:29,808 INFO L87 Difference]: Start difference. First operand 1208 states and 4325 transitions. Second operand 4 states. [2020-10-15 18:35:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:29,855 INFO L93 Difference]: Finished difference Result 1255 states and 4100 transitions. [2020-10-15 18:35:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:35:29,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-15 18:35:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:29,863 INFO L225 Difference]: With dead ends: 1255 [2020-10-15 18:35:29,863 INFO L226 Difference]: Without dead ends: 959 [2020-10-15 18:35:29,863 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:35:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-10-15 18:35:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2020-10-15 18:35:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2020-10-15 18:35:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 3118 transitions. [2020-10-15 18:35:29,890 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 3118 transitions. Word has length 15 [2020-10-15 18:35:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:29,891 INFO L481 AbstractCegarLoop]: Abstraction has 959 states and 3118 transitions. [2020-10-15 18:35:29,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:35:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 3118 transitions. [2020-10-15 18:35:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:35:29,893 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:29,893 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:35:29,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:35:29,893 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:35:29,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1289795681, now seen corresponding path program 1 times [2020-10-15 18:35:29,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:29,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630435313] [2020-10-15 18:35:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:29,994 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:35:29,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630435313] [2020-10-15 18:35:29,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:29,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:35:29,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772247507] [2020-10-15 18:35:29,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:35:29,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:35:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:35:29,996 INFO L87 Difference]: Start difference. First operand 959 states and 3118 transitions. Second operand 5 states. [2020-10-15 18:35:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:30,063 INFO L93 Difference]: Finished difference Result 827 states and 2453 transitions. [2020-10-15 18:35:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:35:30,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:35:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:30,068 INFO L225 Difference]: With dead ends: 827 [2020-10-15 18:35:30,068 INFO L226 Difference]: Without dead ends: 627 [2020-10-15 18:35:30,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:35:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-10-15 18:35:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2020-10-15 18:35:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2020-10-15 18:35:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1820 transitions. [2020-10-15 18:35:30,084 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1820 transitions. Word has length 17 [2020-10-15 18:35:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:30,085 INFO L481 AbstractCegarLoop]: Abstraction has 627 states and 1820 transitions. [2020-10-15 18:35:30,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:35:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1820 transitions. [2020-10-15 18:35:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:35:30,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:30,086 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:35:30,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:35:30,087 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:35:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash -508256966, now seen corresponding path program 1 times [2020-10-15 18:35:30,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:30,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282718577] [2020-10-15 18:35:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:30,280 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:35:30,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282718577] [2020-10-15 18:35:30,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:30,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:35:30,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606659158] [2020-10-15 18:35:30,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:35:30,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:35:30,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:35:30,283 INFO L87 Difference]: Start difference. First operand 627 states and 1820 transitions. Second operand 7 states. [2020-10-15 18:35:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:30,597 INFO L93 Difference]: Finished difference Result 1300 states and 3717 transitions. [2020-10-15 18:35:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:35:30,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-15 18:35:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:30,608 INFO L225 Difference]: With dead ends: 1300 [2020-10-15 18:35:30,608 INFO L226 Difference]: Without dead ends: 1027 [2020-10-15 18:35:30,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:35:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-10-15 18:35:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 798. [2020-10-15 18:35:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-10-15 18:35:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2311 transitions. [2020-10-15 18:35:30,637 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2311 transitions. Word has length 19 [2020-10-15 18:35:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:30,638 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 2311 transitions. [2020-10-15 18:35:30,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:35:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2311 transitions. [2020-10-15 18:35:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:35:30,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:30,640 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:35:30,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:35:30,640 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:35:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:30,642 INFO L82 PathProgramCache]: Analyzing trace with hash 50473239, now seen corresponding path program 1 times [2020-10-15 18:35:30,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:30,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465424351] [2020-10-15 18:35:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:30,818 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:35:30,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465424351] [2020-10-15 18:35:30,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:30,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:35:30,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159859065] [2020-10-15 18:35:30,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:35:30,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:35:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:35:30,820 INFO L87 Difference]: Start difference. First operand 798 states and 2311 transitions. Second operand 6 states. [2020-10-15 18:35:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:30,904 INFO L93 Difference]: Finished difference Result 704 states and 1992 transitions. [2020-10-15 18:35:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:35:30,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:35:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:30,909 INFO L225 Difference]: With dead ends: 704 [2020-10-15 18:35:30,909 INFO L226 Difference]: Without dead ends: 609 [2020-10-15 18:35:30,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:35:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-10-15 18:35:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2020-10-15 18:35:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2020-10-15 18:35:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1749 transitions. [2020-10-15 18:35:30,931 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1749 transitions. Word has length 19 [2020-10-15 18:35:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:30,933 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 1749 transitions. [2020-10-15 18:35:30,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:35:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1749 transitions. [2020-10-15 18:35:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 18:35:30,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:30,938 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] [2020-10-15 18:35:30,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:35:30,938 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:35:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:30,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1910049042, now seen corresponding path program 1 times [2020-10-15 18:35:30,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:30,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837083094] [2020-10-15 18:35:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:31,230 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:35:31,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837083094] [2020-10-15 18:35:31,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:31,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:35:31,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291526824] [2020-10-15 18:35:31,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:35:31,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:35:31,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:35:31,232 INFO L87 Difference]: Start difference. First operand 609 states and 1749 transitions. Second operand 8 states. [2020-10-15 18:35:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:31,639 INFO L93 Difference]: Finished difference Result 1175 states and 3217 transitions. [2020-10-15 18:35:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:35:31,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-15 18:35:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:31,646 INFO L225 Difference]: With dead ends: 1175 [2020-10-15 18:35:31,646 INFO L226 Difference]: Without dead ends: 1032 [2020-10-15 18:35:31,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:35:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2020-10-15 18:35:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 655. [2020-10-15 18:35:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2020-10-15 18:35:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1874 transitions. [2020-10-15 18:35:31,664 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1874 transitions. Word has length 21 [2020-10-15 18:35:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:31,664 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 1874 transitions. [2020-10-15 18:35:31,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:35:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1874 transitions. [2020-10-15 18:35:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 18:35:31,666 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:31,666 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] [2020-10-15 18:35:31,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:35:31,667 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:35:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash 130480764, now seen corresponding path program 2 times [2020-10-15 18:35:31,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:31,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568905211] [2020-10-15 18:35:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:31,955 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:35:31,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568905211] [2020-10-15 18:35:31,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:31,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:35:31,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408430266] [2020-10-15 18:35:31,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:35:31,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:31,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:35:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:35:31,959 INFO L87 Difference]: Start difference. First operand 655 states and 1874 transitions. Second operand 10 states. [2020-10-15 18:35:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:32,589 INFO L93 Difference]: Finished difference Result 1113 states and 3019 transitions. [2020-10-15 18:35:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:35:32,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-15 18:35:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:32,596 INFO L225 Difference]: With dead ends: 1113 [2020-10-15 18:35:32,597 INFO L226 Difference]: Without dead ends: 1113 [2020-10-15 18:35:32,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-10-15 18:35:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-10-15 18:35:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 691. [2020-10-15 18:35:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-10-15 18:35:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1970 transitions. [2020-10-15 18:35:32,616 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1970 transitions. Word has length 21 [2020-10-15 18:35:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:32,616 INFO L481 AbstractCegarLoop]: Abstraction has 691 states and 1970 transitions. [2020-10-15 18:35:32,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:35:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1970 transitions. [2020-10-15 18:35:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 18:35:32,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:32,618 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] [2020-10-15 18:35:32,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:35:32,619 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:35:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1585075806, now seen corresponding path program 3 times [2020-10-15 18:35:32,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:32,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785479468] [2020-10-15 18:35:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:32,905 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:35:32,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785479468] [2020-10-15 18:35:32,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:32,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:35:32,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301301268] [2020-10-15 18:35:32,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:35:32,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:32,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:35:32,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:35:32,908 INFO L87 Difference]: Start difference. First operand 691 states and 1970 transitions. Second operand 9 states. [2020-10-15 18:35:33,459 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-10-15 18:35:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:33,528 INFO L93 Difference]: Finished difference Result 1018 states and 2830 transitions. [2020-10-15 18:35:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:35:33,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-15 18:35:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:33,535 INFO L225 Difference]: With dead ends: 1018 [2020-10-15 18:35:33,535 INFO L226 Difference]: Without dead ends: 1018 [2020-10-15 18:35:33,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-15 18:35:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-10-15 18:35:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 711. [2020-10-15 18:35:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2020-10-15 18:35:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2028 transitions. [2020-10-15 18:35:33,556 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 2028 transitions. Word has length 21 [2020-10-15 18:35:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:33,557 INFO L481 AbstractCegarLoop]: Abstraction has 711 states and 2028 transitions. [2020-10-15 18:35:33,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:35:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 2028 transitions. [2020-10-15 18:35:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 18:35:33,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:33,559 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] [2020-10-15 18:35:33,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:35:33,560 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:35:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1794917315, now seen corresponding path program 1 times [2020-10-15 18:35:33,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:33,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023768025] [2020-10-15 18:35:33,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:33,606 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:35:33,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023768025] [2020-10-15 18:35:33,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:33,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:35:33,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716340944] [2020-10-15 18:35:33,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:35:33,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:35:33,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:35:33,608 INFO L87 Difference]: Start difference. First operand 711 states and 2028 transitions. Second operand 3 states. [2020-10-15 18:35:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:33,621 INFO L93 Difference]: Finished difference Result 962 states and 2700 transitions. [2020-10-15 18:35:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:35:33,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-15 18:35:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:33,624 INFO L225 Difference]: With dead ends: 962 [2020-10-15 18:35:33,624 INFO L226 Difference]: Without dead ends: 659 [2020-10-15 18:35:33,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:35:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-15 18:35:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 652. [2020-10-15 18:35:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2020-10-15 18:35:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1778 transitions. [2020-10-15 18:35:33,639 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1778 transitions. Word has length 21 [2020-10-15 18:35:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:33,639 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 1778 transitions. [2020-10-15 18:35:33,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:35:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1778 transitions. [2020-10-15 18:35:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 18:35:33,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:33,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:35:33,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:35:33,641 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:35:33,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:33,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1738089230, now seen corresponding path program 4 times [2020-10-15 18:35:33,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:33,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525585036] [2020-10-15 18:35:33,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:33,903 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:35:33,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525585036] [2020-10-15 18:35:33,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:33,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:35:33,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582935779] [2020-10-15 18:35:33,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:35:33,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:33,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:35:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:35:33,905 INFO L87 Difference]: Start difference. First operand 652 states and 1778 transitions. Second operand 9 states. [2020-10-15 18:35:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:34,386 INFO L93 Difference]: Finished difference Result 1106 states and 2896 transitions. [2020-10-15 18:35:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 18:35:34,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-15 18:35:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:34,391 INFO L225 Difference]: With dead ends: 1106 [2020-10-15 18:35:34,391 INFO L226 Difference]: Without dead ends: 1007 [2020-10-15 18:35:34,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:35:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2020-10-15 18:35:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 572. [2020-10-15 18:35:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-10-15 18:35:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1573 transitions. [2020-10-15 18:35:34,407 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1573 transitions. Word has length 21 [2020-10-15 18:35:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:34,407 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 1573 transitions. [2020-10-15 18:35:34,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:35:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1573 transitions. [2020-10-15 18:35:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 18:35:34,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:34,409 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] [2020-10-15 18:35:34,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:35:34,409 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:35:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -172828862, now seen corresponding path program 5 times [2020-10-15 18:35:34,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:34,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41767003] [2020-10-15 18:35:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:34,602 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:35:34,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41767003] [2020-10-15 18:35:34,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:34,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:35:34,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317104713] [2020-10-15 18:35:34,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:35:34,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:35:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:35:34,604 INFO L87 Difference]: Start difference. First operand 572 states and 1573 transitions. Second operand 7 states. [2020-10-15 18:35:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:34,677 INFO L93 Difference]: Finished difference Result 550 states and 1527 transitions. [2020-10-15 18:35:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:35:34,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-15 18:35:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:34,680 INFO L225 Difference]: With dead ends: 550 [2020-10-15 18:35:34,680 INFO L226 Difference]: Without dead ends: 396 [2020-10-15 18:35:34,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:35:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2020-10-15 18:35:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2020-10-15 18:35:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-10-15 18:35:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1134 transitions. [2020-10-15 18:35:34,689 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1134 transitions. Word has length 21 [2020-10-15 18:35:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:34,689 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 1134 transitions. [2020-10-15 18:35:34,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:35:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1134 transitions. [2020-10-15 18:35:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:35:34,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:34,691 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] [2020-10-15 18:35:34,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:35:34,691 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:35:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1141861654, now seen corresponding path program 1 times [2020-10-15 18:35:34,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:34,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439388553] [2020-10-15 18:35:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:34,751 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:35:34,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439388553] [2020-10-15 18:35:34,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:34,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:35:34,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394915174] [2020-10-15 18:35:34,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:35:34,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:35:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:35:34,754 INFO L87 Difference]: Start difference. First operand 396 states and 1134 transitions. Second operand 4 states. [2020-10-15 18:35:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:34,774 INFO L93 Difference]: Finished difference Result 521 states and 1470 transitions. [2020-10-15 18:35:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:35:34,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-15 18:35:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:34,776 INFO L225 Difference]: With dead ends: 521 [2020-10-15 18:35:34,777 INFO L226 Difference]: Without dead ends: 273 [2020-10-15 18:35:34,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:35:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-15 18:35:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2020-10-15 18:35:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-15 18:35:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 708 transitions. [2020-10-15 18:35:34,783 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 708 transitions. Word has length 24 [2020-10-15 18:35:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:34,783 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 708 transitions. [2020-10-15 18:35:34,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:35:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 708 transitions. [2020-10-15 18:35:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:35:34,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:34,785 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] [2020-10-15 18:35:34,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:35:34,785 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:35:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2140413110, now seen corresponding path program 2 times [2020-10-15 18:35:34,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:34,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662079451] [2020-10-15 18:35:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:35,384 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:35:35,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662079451] [2020-10-15 18:35:35,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:35,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:35:35,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867150094] [2020-10-15 18:35:35,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:35:35,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:35:35,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:35:35,386 INFO L87 Difference]: Start difference. First operand 273 states and 708 transitions. Second operand 10 states. [2020-10-15 18:35:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:35,831 INFO L93 Difference]: Finished difference Result 472 states and 1186 transitions. [2020-10-15 18:35:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:35:35,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 18:35:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:35,833 INFO L225 Difference]: With dead ends: 472 [2020-10-15 18:35:35,833 INFO L226 Difference]: Without dead ends: 390 [2020-10-15 18:35:35,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:35:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2020-10-15 18:35:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 269. [2020-10-15 18:35:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-15 18:35:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 696 transitions. [2020-10-15 18:35:35,841 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 696 transitions. Word has length 24 [2020-10-15 18:35:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:35,841 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 696 transitions. [2020-10-15 18:35:35,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:35:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 696 transitions. [2020-10-15 18:35:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:35:35,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:35,843 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] [2020-10-15 18:35:35,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:35:35,843 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:35:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1659750742, now seen corresponding path program 3 times [2020-10-15 18:35:35,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:35,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657269530] [2020-10-15 18:35:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:36,535 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:35:36,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657269530] [2020-10-15 18:35:36,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:36,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:35:36,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915391757] [2020-10-15 18:35:36,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:35:36,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:36,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:35:36,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:35:36,537 INFO L87 Difference]: Start difference. First operand 269 states and 696 transitions. Second operand 10 states. [2020-10-15 18:35:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:36,932 INFO L93 Difference]: Finished difference Result 496 states and 1237 transitions. [2020-10-15 18:35:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:35:36,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 18:35:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:36,934 INFO L225 Difference]: With dead ends: 496 [2020-10-15 18:35:36,934 INFO L226 Difference]: Without dead ends: 314 [2020-10-15 18:35:36,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:35:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-15 18:35:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 239. [2020-10-15 18:35:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-10-15 18:35:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 612 transitions. [2020-10-15 18:35:36,943 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 612 transitions. Word has length 24 [2020-10-15 18:35:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:36,943 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 612 transitions. [2020-10-15 18:35:36,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:35:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 612 transitions. [2020-10-15 18:35:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:35:36,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:36,944 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] [2020-10-15 18:35:36,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:35:36,944 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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:35:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash -4480626, now seen corresponding path program 4 times [2020-10-15 18:35:36,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:36,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839969227] [2020-10-15 18:35:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:37,337 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-10-15 18:35:37,697 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:35:37,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839969227] [2020-10-15 18:35:37,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:37,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:35:37,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002213795] [2020-10-15 18:35:37,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:35:37,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:37,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:35:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:35:37,699 INFO L87 Difference]: Start difference. First operand 239 states and 612 transitions. Second operand 10 states. [2020-10-15 18:35:38,279 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-15 18:35:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:38,430 INFO L93 Difference]: Finished difference Result 376 states and 963 transitions. [2020-10-15 18:35:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:35:38,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 18:35:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:38,432 INFO L225 Difference]: With dead ends: 376 [2020-10-15 18:35:38,433 INFO L226 Difference]: Without dead ends: 330 [2020-10-15 18:35:38,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:35:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-10-15 18:35:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 269. [2020-10-15 18:35:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-15 18:35:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 695 transitions. [2020-10-15 18:35:38,445 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 695 transitions. Word has length 24 [2020-10-15 18:35:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:38,447 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 695 transitions. [2020-10-15 18:35:38,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:35:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 695 transitions. [2020-10-15 18:35:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:35:38,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:38,450 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] [2020-10-15 18:35:38,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 18:35:38,450 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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:35:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2004667446, now seen corresponding path program 5 times [2020-10-15 18:35:38,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:38,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198585132] [2020-10-15 18:35:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:38,927 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-10-15 18:35:39,284 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:35:39,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198585132] [2020-10-15 18:35:39,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:39,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:35:39,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730008826] [2020-10-15 18:35:39,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:35:39,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:39,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:35:39,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:35:39,286 INFO L87 Difference]: Start difference. First operand 269 states and 695 transitions. Second operand 10 states. [2020-10-15 18:35:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:39,737 INFO L93 Difference]: Finished difference Result 372 states and 937 transitions. [2020-10-15 18:35:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:35:39,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 18:35:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:39,740 INFO L225 Difference]: With dead ends: 372 [2020-10-15 18:35:39,740 INFO L226 Difference]: Without dead ends: 346 [2020-10-15 18:35:39,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:35:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-10-15 18:35:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 269. [2020-10-15 18:35:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-15 18:35:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 695 transitions. [2020-10-15 18:35:39,746 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 695 transitions. Word has length 24 [2020-10-15 18:35:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:39,747 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 695 transitions. [2020-10-15 18:35:39,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:35:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 695 transitions. [2020-10-15 18:35:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:35:39,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:39,748 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] [2020-10-15 18:35:39,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 18:35:39,748 INFO L429 AbstractCegarLoop]: === Iteration 22 === [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:35:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash -722668682, now seen corresponding path program 6 times [2020-10-15 18:35:39,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:39,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749483862] [2020-10-15 18:35:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:35:40,195 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:35:40,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749483862] [2020-10-15 18:35:40,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:35:40,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 18:35:40,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830294245] [2020-10-15 18:35:40,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 18:35:40,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:35:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 18:35:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:35:40,197 INFO L87 Difference]: Start difference. First operand 269 states and 695 transitions. Second operand 10 states. [2020-10-15 18:35:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:35:40,658 INFO L93 Difference]: Finished difference Result 410 states and 1028 transitions. [2020-10-15 18:35:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:35:40,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 18:35:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:35:40,659 INFO L225 Difference]: With dead ends: 410 [2020-10-15 18:35:40,659 INFO L226 Difference]: Without dead ends: 332 [2020-10-15 18:35:40,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:35:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-15 18:35:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 249. [2020-10-15 18:35:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-10-15 18:35:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 635 transitions. [2020-10-15 18:35:40,665 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 635 transitions. Word has length 24 [2020-10-15 18:35:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:35:40,665 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 635 transitions. [2020-10-15 18:35:40,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 18:35:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 635 transitions. [2020-10-15 18:35:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:35:40,666 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:35:40,667 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] [2020-10-15 18:35:40,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 18:35:40,667 INFO L429 AbstractCegarLoop]: === Iteration 23 === [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:35:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:35:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash 312078982, now seen corresponding path program 7 times [2020-10-15 18:35:40,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:35:40,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440091423] [2020-10-15 18:35:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:35:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:35:40,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:35:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:35:40,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:35:40,851 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:35:40,851 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:35:40,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 18:35:40,853 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:35:40,891 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1789] [1789] L3-->L889: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In-1033608816 256) 0)) (.cse7 (= (mod ~x$w_buff1_used~0_In-1033608816 256) 0)) (.cse10 (= (mod ~x$r_buff0_thd0~0_In-1033608816 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-1033608816 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse10)) (.cse0 (or .cse9 .cse10)) (.cse5 (or .cse8 .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse7))) (and (= ~x$r_buff0_thd0~0_In-1033608816 ~x$r_buff0_thd0~0_Out-1033608816) (= ~x$r_buff1_thd0~0_Out-1033608816 ~x$r_buff1_thd0~0_In-1033608816) (or (and (= ~x$w_buff0_used~0_Out-1033608816 ~x$w_buff0_used~0_In-1033608816) .cse0) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out-1033608816 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1033608816 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1033608816|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1033608816 0)) (or (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out-1033608816 0)) (and (= ~x$w_buff1_used~0_In-1033608816 ~x$w_buff1_used~0_Out-1033608816) .cse5)) (let ((.cse6 (select |#memory_int_In-1033608816| |~#x~0.base_In-1033608816|))) (or (and .cse1 .cse2 (= (store |#memory_int_In-1033608816| |~#x~0.base_In-1033608816| (store .cse6 |~#x~0.offset_In-1033608816| ~x$w_buff0~0_In-1033608816)) |#memory_int_Out-1033608816|)) (and .cse0 (or (and .cse5 (= |#memory_int_Out-1033608816| (store |#memory_int_In-1033608816| |~#x~0.base_In-1033608816| (store .cse6 |~#x~0.offset_In-1033608816| (select .cse6 |~#x~0.offset_In-1033608816|))))) (and (= |#memory_int_Out-1033608816| (store |#memory_int_In-1033608816| |~#x~0.base_In-1033608816| (store .cse6 |~#x~0.offset_In-1033608816| ~x$w_buff1~0_In-1033608816))) .cse3 .cse4)))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1033608816, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1033608816, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1033608816|, ~#x~0.offset=|~#x~0.offset_In-1033608816|, ~x$w_buff1~0=~x$w_buff1~0_In-1033608816, #memory_int=|#memory_int_In-1033608816|, ~#x~0.base=|~#x~0.base_In-1033608816|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1033608816, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1033608816, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033608816} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1033608816, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1033608816, ~#x~0.offset=|~#x~0.offset_In-1033608816|, ~x$w_buff1~0=~x$w_buff1~0_In-1033608816, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1033608816, ULTIMATE.start_main_#t~ite104=|ULTIMATE.start_main_#t~ite104_Out-1033608816|, ULTIMATE.start_main_#t~ite105=|ULTIMATE.start_main_#t~ite105_Out-1033608816|, ULTIMATE.start_main_#t~ite106=|ULTIMATE.start_main_#t~ite106_Out-1033608816|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1033608816, ULTIMATE.start_main_#t~ite107=|ULTIMATE.start_main_#t~ite107_Out-1033608816|, ULTIMATE.start_main_#t~ite108=|ULTIMATE.start_main_#t~ite108_Out-1033608816|, ULTIMATE.start_main_#t~ite109=|ULTIMATE.start_main_#t~ite109_Out-1033608816|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1033608816, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1033608816|, ULTIMATE.start_main_#t~mem103=|ULTIMATE.start_main_#t~mem103_Out-1033608816|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1033608816, #memory_int=|#memory_int_Out-1033608816|, ~#x~0.base=|~#x~0.base_In-1033608816|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite104, ULTIMATE.start_main_#t~ite105, ULTIMATE.start_main_#t~ite106, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite107, ULTIMATE.start_main_#t~ite108, ULTIMATE.start_main_#t~ite109, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~mem103, ULTIMATE.start_assume_abort_if_not_~cond, #memory_int] because there is no mapped edge [2020-10-15 18:35:40,907 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:35:40,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,908 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:35:40,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,909 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:35:40,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,909 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:35:40,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,910 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:35:40,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,910 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:35:40,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,910 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:35:40,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,911 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:35:40,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,911 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:35:40,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,911 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:35:40,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,912 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:35:40,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,916 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:35:40,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,917 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:35:40,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,917 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:35:40,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,918 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:35:40,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,918 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:35:40,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,918 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:35:40,918 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,918 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:35:40,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,919 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:35:40,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,919 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:35:40,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,919 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:35:40,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,920 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:35:40,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,920 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:35:40,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,920 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:35:40,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,921 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:35:40,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,921 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:35:40,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,921 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:35:40,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,921 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:35:40,922 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,923 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:35:40,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,923 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:35:40,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,924 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:35:40,924 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,925 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:35:40,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,925 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:35:40,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,925 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:35:40,926 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,926 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:35:40,926 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,926 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:35:40,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,927 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:35:40,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,927 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:35:40,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,928 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:35:40,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,928 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:35:40,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,929 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:35:40,929 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:40,929 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:35:40,929 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:35:41,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:35:41 BasicIcfg [2020-10-15 18:35:41,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:35:41,049 INFO L168 Benchmark]: Toolchain (without parser) took 31084.41 ms. Allocated memory was 250.6 MB in the beginning and 783.3 MB in the end (delta: 532.7 MB). Free memory was 205.9 MB in the beginning and 359.0 MB in the end (delta: -153.0 MB). Peak memory consumption was 379.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:35:41,049 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:35:41,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.26 ms. Allocated memory was 250.6 MB in the beginning and 311.4 MB in the end (delta: 60.8 MB). Free memory was 205.9 MB in the beginning and 254.4 MB in the end (delta: -48.4 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:35:41,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.59 ms. Allocated memory is still 311.4 MB. Free memory was 254.4 MB in the beginning and 251.9 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:35:41,050 INFO L168 Benchmark]: Boogie Preprocessor took 51.48 ms. Allocated memory is still 311.4 MB. Free memory was 251.9 MB in the beginning and 249.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:35:41,053 INFO L168 Benchmark]: RCFGBuilder took 3471.17 ms. Allocated memory was 311.4 MB in the beginning and 434.6 MB in the end (delta: 123.2 MB). Free memory was 249.3 MB in the beginning and 323.9 MB in the end (delta: -74.5 MB). Peak memory consumption was 155.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:35:41,056 INFO L168 Benchmark]: TraceAbstraction took 26659.00 ms. Allocated memory was 434.6 MB in the beginning and 783.3 MB in the end (delta: 348.7 MB). Free memory was 323.9 MB in the beginning and 359.0 MB in the end (delta: -35.1 MB). Peak memory consumption was 313.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:35:41,060 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.20 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 829.26 ms. Allocated memory was 250.6 MB in the beginning and 311.4 MB in the end (delta: 60.8 MB). Free memory was 205.9 MB in the beginning and 254.4 MB in the end (delta: -48.4 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.59 ms. Allocated memory is still 311.4 MB. Free memory was 254.4 MB in the beginning and 251.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 51.48 ms. Allocated memory is still 311.4 MB. Free memory was 251.9 MB in the beginning and 249.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3471.17 ms. Allocated memory was 311.4 MB in the beginning and 434.6 MB in the end (delta: 123.2 MB). Free memory was 249.3 MB in the beginning and 323.9 MB in the end (delta: -74.5 MB). Peak memory consumption was 155.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 26659.00 ms. Allocated memory was 434.6 MB in the beginning and 783.3 MB in the end (delta: 348.7 MB). Free memory was 323.9 MB in the beginning and 359.0 MB in the end (delta: -35.1 MB). Peak memory consumption was 313.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1447 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 146 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.7s, 137 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 5605 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L704] 0 int __unbuffered_p0_EBX = 0; [L706] 0 int __unbuffered_p2_EAX = 0; [L707] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L708] 0 int __unbuffered_p2_EAX$mem_tmp; [L709] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L710] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L711] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L712] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L713] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L714] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L715] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L716] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L719] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L720] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L721] 0 int __unbuffered_p2_EAX$w_buff0; [L722] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L723] 0 int __unbuffered_p2_EAX$w_buff1; [L724] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L729] 0 _Bool x$flush_delayed; [L730] 0 int x$mem_tmp; [L731] 0 _Bool x$r_buff0_thd0; [L732] 0 _Bool x$r_buff0_thd1; [L733] 0 _Bool x$r_buff0_thd2; [L734] 0 _Bool x$r_buff0_thd3; [L735] 0 _Bool x$r_buff0_thd4; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$r_buff1_thd3; [L740] 0 _Bool x$r_buff1_thd4; [L741] 0 _Bool x$read_delayed; [L742] 0 int *x$read_delayed_var; [L743] 0 int x$w_buff0; [L744] 0 _Bool x$w_buff0_used; [L745] 0 int x$w_buff1; [L746] 0 _Bool x$w_buff1_used; [L748] 0 int y = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice1; [L751] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2229; [L872] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6: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] [L873] 0 pthread_t t2230; [L874] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6: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] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 1 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L793] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L875] 0 pthread_t t2231; [L876] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L877] 0 pthread_t t2232; [L878] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 x$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(x) [L813] 3 x$mem_tmp = x [L814] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L815] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L816] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] EXPR 3 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L817] EXPR 3 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L818] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L819] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] EXPR 3 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L819] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=1, weak$$choice2=255, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=1, weak$$choice2=255, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=1, weak$$choice2=255, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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$$choice1=1, weak$$choice2=255, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 1 x$flush_delayed = weak$$choice2 [L761] EXPR 1 \read(x) [L761] 1 x$mem_tmp = x [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L762] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L763] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0 [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L763] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L763] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L764] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L764] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L765] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L767] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L768] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 \read(x) [L769] 1 __unbuffered_p0_EBX = x [L770] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L770] EXPR 1 \read(x) [L770] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L770] 1 x = x$flush_delayed ? x$mem_tmp : x [L771] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=1, weak$$choice2=0, x={6: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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] 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) [L849] 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) [L850] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L851] 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 [L852] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L853] 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 [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L796] 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) [L796] 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) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 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 [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L800] 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 [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L832] 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) [L832] 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) [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 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 [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] 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 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=1, weak$$choice2=0, x={6: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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 125 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.8s, HoareTripleCheckerStatistics: 785 SDtfs, 814 SDslu, 2664 SDs, 0 SdLazy, 2196 SolverSat, 248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2250occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 2342 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 143182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...