/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:42:16,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:42:16,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:42:16,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:42:16,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:42:16,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:42:16,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:42:16,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:42:16,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:42:16,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:42:16,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:42:16,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:42:16,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:42:16,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:42:16,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:42:16,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:42:16,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:42:16,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:42:16,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:42:16,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:42:16,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:42:16,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:42:16,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:42:16,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:42:16,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:42:16,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:42:16,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:42:16,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:42:16,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:42:16,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:42:16,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:42:16,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:42:16,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:42:16,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:42:16,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:42:16,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:42:16,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:42:16,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:42:16,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:42:16,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:42:16,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:42:16,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:42:16,667 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:42:16,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:42:16,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:42:16,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:42:16,669 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:42:16,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:42:16,669 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:42:16,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:42:16,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:42:16,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:42:16,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:42:16,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:42:16,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:42:16,673 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:42:16,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:42:16,674 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:42:16,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:42:16,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:42:16,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:42:16,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:42:16,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:42:16,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:42:16,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:42:16,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:42:16,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:42:16,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:42:16,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:42:16,676 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:42:16,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:42:17,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:42:17,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:42:17,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:42:17,018 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:42:17,019 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:42:17,020 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2020-10-05 23:42:17,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827fe1faa/1202f973abbc4103b4f2a73073b95da5/FLAGde89fabf4 [2020-10-05 23:42:17,628 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:42:17,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2020-10-05 23:42:17,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827fe1faa/1202f973abbc4103b4f2a73073b95da5/FLAGde89fabf4 [2020-10-05 23:42:17,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827fe1faa/1202f973abbc4103b4f2a73073b95da5 [2020-10-05 23:42:17,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:42:17,979 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:42:17,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:17,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:42:17,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:42:17,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:17" (1/1) ... [2020-10-05 23:42:17,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c464c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:17, skipping insertion in model container [2020-10-05 23:42:17,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:17" (1/1) ... [2020-10-05 23:42:17,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:42:18,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:42:18,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:18,602 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:42:18,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:18,783 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:42:18,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18 WrapperNode [2020-10-05 23:42:18,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:18,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:18,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:42:18,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:42:18,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:18,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:42:18,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:42:18,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:42:18,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:42:18,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:42:18,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:42:18,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:42:18,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (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-05 23:42:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:42:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:42:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:42:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:42:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:42:19,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:42:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:42:19,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:42:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:42:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:42:19,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:42:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:42:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:42:19,021 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:42:22,726 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:42:22,726 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:42:22,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:22 BoogieIcfgContainer [2020-10-05 23:42:22,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:42:22,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:42:22,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:42:22,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:42:22,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:42:17" (1/3) ... [2020-10-05 23:42:22,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5751411d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:22, skipping insertion in model container [2020-10-05 23:42:22,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18" (2/3) ... [2020-10-05 23:42:22,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5751411d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:22, skipping insertion in model container [2020-10-05 23:42:22,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:22" (3/3) ... [2020-10-05 23:42:22,739 INFO L109 eAbstractionObserver]: Analyzing ICFG safe032_pso.opt.i [2020-10-05 23:42:22,750 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:42:22,751 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:42:22,760 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:42:22,761 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:42:22,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,803 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,803 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,813 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,813 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,827 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,827 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,827 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,855 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,857 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:22,873 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:42:22,894 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:42:22,894 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:42:22,894 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:42:22,895 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:42:22,895 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:42:22,895 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:42:22,895 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:42:22,895 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:42:22,911 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:22,914 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:22,961 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:42:22,961 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:22,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:42:22,970 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:22,994 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:42:22,994 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:22,995 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:42:22,997 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1624 [2020-10-05 23:42:22,998 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:42:23,330 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-05 23:42:24,287 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:42:25,730 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-05 23:42:25,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-05 23:42:25,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:25,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:42:25,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:26,968 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2020-10-05 23:42:28,177 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-05 23:42:28,479 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-05 23:42:29,936 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-05 23:42:30,395 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:42:30,625 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-05 23:42:30,733 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:42:30,746 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4118 [2020-10-05 23:42:30,746 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:42:30,751 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:42:30,821 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-05 23:42:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-05 23:42:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:42:30,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:30,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:30,858 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1033422208, now seen corresponding path program 1 times [2020-10-05 23:42:30,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:30,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077611505] [2020-10-05 23:42:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:31,214 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-05 23:42:31,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077611505] [2020-10-05 23:42:31,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:31,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:31,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336935944] [2020-10-05 23:42:31,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:31,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:31,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:31,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:31,241 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-05 23:42:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:31,439 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2020-10-05 23:42:31,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:31,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:42:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:31,482 INFO L225 Difference]: With dead ends: 658 [2020-10-05 23:42:31,482 INFO L226 Difference]: Without dead ends: 538 [2020-10-05 23:42:31,483 INFO L675 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-05 23:42:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-10-05 23:42:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-10-05 23:42:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-10-05 23:42:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2020-10-05 23:42:31,591 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7 [2020-10-05 23:42:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:31,592 INFO L479 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2020-10-05 23:42:31,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2020-10-05 23:42:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:31,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:31,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:31,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:42:31,595 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 981365630, now seen corresponding path program 1 times [2020-10-05 23:42:31,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:31,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216403633] [2020-10-05 23:42:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:31,717 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-05 23:42:31,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216403633] [2020-10-05 23:42:31,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:31,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:31,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661354513] [2020-10-05 23:42:31,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:31,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:31,720 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 3 states. [2020-10-05 23:42:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:31,737 INFO L93 Difference]: Finished difference Result 478 states and 1431 transitions. [2020-10-05 23:42:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:31,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:42:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:31,743 INFO L225 Difference]: With dead ends: 478 [2020-10-05 23:42:31,743 INFO L226 Difference]: Without dead ends: 478 [2020-10-05 23:42:31,744 INFO L675 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-05 23:42:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-05 23:42:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2020-10-05 23:42:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-10-05 23:42:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1431 transitions. [2020-10-05 23:42:31,770 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1431 transitions. Word has length 9 [2020-10-05 23:42:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:31,770 INFO L479 AbstractCegarLoop]: Abstraction has 478 states and 1431 transitions. [2020-10-05 23:42:31,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1431 transitions. [2020-10-05 23:42:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:42:31,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:31,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:31,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:42:31,778 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:31,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:31,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1678623485, now seen corresponding path program 1 times [2020-10-05 23:42:31,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:31,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139512519] [2020-10-05 23:42:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:31,885 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-05 23:42:31,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139512519] [2020-10-05 23:42:31,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:31,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:31,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925882496] [2020-10-05 23:42:31,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:31,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:31,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:31,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:31,887 INFO L87 Difference]: Start difference. First operand 478 states and 1431 transitions. Second operand 3 states. [2020-10-05 23:42:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:31,899 INFO L93 Difference]: Finished difference Result 472 states and 1409 transitions. [2020-10-05 23:42:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:31,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:42:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:31,905 INFO L225 Difference]: With dead ends: 472 [2020-10-05 23:42:31,905 INFO L226 Difference]: Without dead ends: 472 [2020-10-05 23:42:31,905 INFO L675 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-05 23:42:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-10-05 23:42:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2020-10-05 23:42:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-05 23:42:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions. [2020-10-05 23:42:31,923 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 12 [2020-10-05 23:42:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:31,923 INFO L479 AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions. [2020-10-05 23:42:31,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions. [2020-10-05 23:42:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:42:31,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:31,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:31,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:42:31,927 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:31,928 INFO L82 PathProgramCache]: Analyzing trace with hash 733241045, now seen corresponding path program 1 times [2020-10-05 23:42:31,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:31,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498336355] [2020-10-05 23:42:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,320 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-05 23:42:32,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498336355] [2020-10-05 23:42:32,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:32,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004224352] [2020-10-05 23:42:32,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:32,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:32,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:32,323 INFO L87 Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 7 states. [2020-10-05 23:42:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,562 INFO L93 Difference]: Finished difference Result 473 states and 1408 transitions. [2020-10-05 23:42:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:32,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-05 23:42:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,567 INFO L225 Difference]: With dead ends: 473 [2020-10-05 23:42:32,568 INFO L226 Difference]: Without dead ends: 473 [2020-10-05 23:42:32,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-10-05 23:42:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 463. [2020-10-05 23:42:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2020-10-05 23:42:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1379 transitions. [2020-10-05 23:42:32,585 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1379 transitions. Word has length 13 [2020-10-05 23:42:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,586 INFO L479 AbstractCegarLoop]: Abstraction has 463 states and 1379 transitions. [2020-10-05 23:42:32,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1379 transitions. [2020-10-05 23:42:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:32,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:42:32,588 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1255080755, now seen corresponding path program 1 times [2020-10-05 23:42:32,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666581483] [2020-10-05 23:42:32,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:32,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666581483] [2020-10-05 23:42:32,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:32,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422062328] [2020-10-05 23:42:32,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:32,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:32,774 INFO L87 Difference]: Start difference. First operand 463 states and 1379 transitions. Second operand 8 states. [2020-10-05 23:42:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:33,302 INFO L93 Difference]: Finished difference Result 711 states and 2117 transitions. [2020-10-05 23:42:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:42:33,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-05 23:42:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:33,309 INFO L225 Difference]: With dead ends: 711 [2020-10-05 23:42:33,309 INFO L226 Difference]: Without dead ends: 711 [2020-10-05 23:42:33,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2020-10-05 23:42:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 609. [2020-10-05 23:42:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2020-10-05 23:42:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1818 transitions. [2020-10-05 23:42:33,339 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1818 transitions. Word has length 14 [2020-10-05 23:42:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:33,339 INFO L479 AbstractCegarLoop]: Abstraction has 609 states and 1818 transitions. [2020-10-05 23:42:33,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1818 transitions. [2020-10-05 23:42:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:33,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:33,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:33,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:42:33,342 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -70668655, now seen corresponding path program 2 times [2020-10-05 23:42:33,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:33,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342523214] [2020-10-05 23:42:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:33,546 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-05 23:42:33,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342523214] [2020-10-05 23:42:33,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:33,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:33,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520169917] [2020-10-05 23:42:33,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:33,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:33,549 INFO L87 Difference]: Start difference. First operand 609 states and 1818 transitions. Second operand 7 states. [2020-10-05 23:42:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:33,891 INFO L93 Difference]: Finished difference Result 808 states and 2354 transitions. [2020-10-05 23:42:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:33,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-05 23:42:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:33,899 INFO L225 Difference]: With dead ends: 808 [2020-10-05 23:42:33,900 INFO L226 Difference]: Without dead ends: 808 [2020-10-05 23:42:33,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-10-05 23:42:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 606. [2020-10-05 23:42:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2020-10-05 23:42:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1788 transitions. [2020-10-05 23:42:33,925 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1788 transitions. Word has length 14 [2020-10-05 23:42:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:33,925 INFO L479 AbstractCegarLoop]: Abstraction has 606 states and 1788 transitions. [2020-10-05 23:42:33,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1788 transitions. [2020-10-05 23:42:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:33,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:33,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:33,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:42:33,929 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash 250991359, now seen corresponding path program 1 times [2020-10-05 23:42:33,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:33,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308795666] [2020-10-05 23:42:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:34,417 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-05 23:42:34,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308795666] [2020-10-05 23:42:34,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:34,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:34,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207859141] [2020-10-05 23:42:34,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:34,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:34,420 INFO L87 Difference]: Start difference. First operand 606 states and 1788 transitions. Second operand 7 states. [2020-10-05 23:42:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:34,770 INFO L93 Difference]: Finished difference Result 718 states and 2148 transitions. [2020-10-05 23:42:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:42:34,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:42:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:34,782 INFO L225 Difference]: With dead ends: 718 [2020-10-05 23:42:34,782 INFO L226 Difference]: Without dead ends: 718 [2020-10-05 23:42:34,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-10-05 23:42:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 620. [2020-10-05 23:42:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-10-05 23:42:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1838 transitions. [2020-10-05 23:42:34,805 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1838 transitions. Word has length 15 [2020-10-05 23:42:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:34,806 INFO L479 AbstractCegarLoop]: Abstraction has 620 states and 1838 transitions. [2020-10-05 23:42:34,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1838 transitions. [2020-10-05 23:42:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:34,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:34,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:34,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:42:34,808 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:34,808 INFO L82 PathProgramCache]: Analyzing trace with hash 251229687, now seen corresponding path program 1 times [2020-10-05 23:42:34,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:34,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034842778] [2020-10-05 23:42:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:35,264 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-05 23:42:35,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034842778] [2020-10-05 23:42:35,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:35,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:42:35,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234377281] [2020-10-05 23:42:35,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:42:35,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:42:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:35,267 INFO L87 Difference]: Start difference. First operand 620 states and 1838 transitions. Second operand 9 states. [2020-10-05 23:42:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:35,585 INFO L93 Difference]: Finished difference Result 692 states and 2049 transitions. [2020-10-05 23:42:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:35,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 23:42:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:35,592 INFO L225 Difference]: With dead ends: 692 [2020-10-05 23:42:35,592 INFO L226 Difference]: Without dead ends: 692 [2020-10-05 23:42:35,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-10-05 23:42:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 576. [2020-10-05 23:42:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2020-10-05 23:42:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1720 transitions. [2020-10-05 23:42:35,615 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1720 transitions. Word has length 15 [2020-10-05 23:42:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:35,616 INFO L479 AbstractCegarLoop]: Abstraction has 576 states and 1720 transitions. [2020-10-05 23:42:35,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:42:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1720 transitions. [2020-10-05 23:42:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:35,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:35,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:35,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:42:35,619 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:35,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash 270007999, now seen corresponding path program 2 times [2020-10-05 23:42:35,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:35,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624820822] [2020-10-05 23:42:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:35,834 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-05 23:42:35,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624820822] [2020-10-05 23:42:35,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:35,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:35,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351639284] [2020-10-05 23:42:35,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:35,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:35,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:35,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:35,836 INFO L87 Difference]: Start difference. First operand 576 states and 1720 transitions. Second operand 5 states. [2020-10-05 23:42:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,010 INFO L93 Difference]: Finished difference Result 834 states and 2419 transitions. [2020-10-05 23:42:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:36,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:42:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,019 INFO L225 Difference]: With dead ends: 834 [2020-10-05 23:42:36,019 INFO L226 Difference]: Without dead ends: 810 [2020-10-05 23:42:36,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-10-05 23:42:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 554. [2020-10-05 23:42:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-10-05 23:42:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1628 transitions. [2020-10-05 23:42:36,042 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1628 transitions. Word has length 15 [2020-10-05 23:42:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,042 INFO L479 AbstractCegarLoop]: Abstraction has 554 states and 1628 transitions. [2020-10-05 23:42:36,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1628 transitions. [2020-10-05 23:42:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:36,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:42:36,045 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2101548220, now seen corresponding path program 1 times [2020-10-05 23:42:36,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299009991] [2020-10-05 23:42:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:36,115 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-05 23:42:36,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299009991] [2020-10-05 23:42:36,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:36,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:42:36,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625938652] [2020-10-05 23:42:36,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:36,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:36,122 INFO L87 Difference]: Start difference. First operand 554 states and 1628 transitions. Second operand 3 states. [2020-10-05 23:42:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,138 INFO L93 Difference]: Finished difference Result 758 states and 2172 transitions. [2020-10-05 23:42:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:36,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-05 23:42:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,143 INFO L225 Difference]: With dead ends: 758 [2020-10-05 23:42:36,143 INFO L226 Difference]: Without dead ends: 423 [2020-10-05 23:42:36,143 INFO L675 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-05 23:42:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-05 23:42:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 408. [2020-10-05 23:42:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-10-05 23:42:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1110 transitions. [2020-10-05 23:42:36,157 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1110 transitions. Word has length 15 [2020-10-05 23:42:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,159 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 1110 transitions. [2020-10-05 23:42:36,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1110 transitions. [2020-10-05 23:42:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:36,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:42:36,160 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -810770517, now seen corresponding path program 1 times [2020-10-05 23:42:36,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328477492] [2020-10-05 23:42:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:36,497 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-05 23:42:36,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328477492] [2020-10-05 23:42:36,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:36,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:36,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189330196] [2020-10-05 23:42:36,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:36,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:36,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:36,500 INFO L87 Difference]: Start difference. First operand 408 states and 1110 transitions. Second operand 8 states. [2020-10-05 23:42:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,761 INFO L93 Difference]: Finished difference Result 652 states and 1751 transitions. [2020-10-05 23:42:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:36,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 23:42:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,766 INFO L225 Difference]: With dead ends: 652 [2020-10-05 23:42:36,767 INFO L226 Difference]: Without dead ends: 468 [2020-10-05 23:42:36,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-10-05 23:42:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2020-10-05 23:42:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-10-05 23:42:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1270 transitions. [2020-10-05 23:42:36,782 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1270 transitions. Word has length 16 [2020-10-05 23:42:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,782 INFO L479 AbstractCegarLoop]: Abstraction has 468 states and 1270 transitions. [2020-10-05 23:42:36,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1270 transitions. [2020-10-05 23:42:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:36,783 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:42:36,784 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash -753244437, now seen corresponding path program 2 times [2020-10-05 23:42:36,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445248768] [2020-10-05 23:42:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:37,132 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-05 23:42:37,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445248768] [2020-10-05 23:42:37,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:37,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:37,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351759181] [2020-10-05 23:42:37,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:37,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:37,135 INFO L87 Difference]: Start difference. First operand 468 states and 1270 transitions. Second operand 8 states. [2020-10-05 23:42:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:37,466 INFO L93 Difference]: Finished difference Result 546 states and 1452 transitions. [2020-10-05 23:42:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:42:37,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 23:42:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:37,471 INFO L225 Difference]: With dead ends: 546 [2020-10-05 23:42:37,471 INFO L226 Difference]: Without dead ends: 518 [2020-10-05 23:42:37,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-10-05 23:42:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 467. [2020-10-05 23:42:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-10-05 23:42:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1265 transitions. [2020-10-05 23:42:37,485 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1265 transitions. Word has length 16 [2020-10-05 23:42:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:37,486 INFO L479 AbstractCegarLoop]: Abstraction has 467 states and 1265 transitions. [2020-10-05 23:42:37,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1265 transitions. [2020-10-05 23:42:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:37,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:37,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:37,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:42:37,488 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:37,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash -219687627, now seen corresponding path program 3 times [2020-10-05 23:42:37,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:37,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938683611] [2020-10-05 23:42:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:37,818 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2020-10-05 23:42:37,845 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-05 23:42:37,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938683611] [2020-10-05 23:42:37,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:37,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:37,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324773749] [2020-10-05 23:42:37,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:37,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:37,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:37,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:37,848 INFO L87 Difference]: Start difference. First operand 467 states and 1265 transitions. Second operand 7 states. [2020-10-05 23:42:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:38,204 INFO L93 Difference]: Finished difference Result 555 states and 1475 transitions. [2020-10-05 23:42:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:42:38,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:42:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:38,210 INFO L225 Difference]: With dead ends: 555 [2020-10-05 23:42:38,210 INFO L226 Difference]: Without dead ends: 525 [2020-10-05 23:42:38,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-10-05 23:42:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 461. [2020-10-05 23:42:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-10-05 23:42:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1249 transitions. [2020-10-05 23:42:38,223 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1249 transitions. Word has length 16 [2020-10-05 23:42:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:38,224 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 1249 transitions. [2020-10-05 23:42:38,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1249 transitions. [2020-10-05 23:42:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:38,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:38,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:38,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:42:38,226 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1265012645, now seen corresponding path program 4 times [2020-10-05 23:42:38,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:38,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36290484] [2020-10-05 23:42:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:42:38,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36290484] [2020-10-05 23:42:38,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:38,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:42:38,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122910833] [2020-10-05 23:42:38,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:42:38,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:38,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:42:38,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:38,660 INFO L87 Difference]: Start difference. First operand 461 states and 1249 transitions. Second operand 9 states. [2020-10-05 23:42:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:39,023 INFO L93 Difference]: Finished difference Result 573 states and 1551 transitions. [2020-10-05 23:42:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:39,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 23:42:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:39,029 INFO L225 Difference]: With dead ends: 573 [2020-10-05 23:42:39,030 INFO L226 Difference]: Without dead ends: 506 [2020-10-05 23:42:39,030 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-10-05 23:42:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 452. [2020-10-05 23:42:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-05 23:42:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1218 transitions. [2020-10-05 23:42:39,043 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1218 transitions. Word has length 16 [2020-10-05 23:42:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:39,043 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1218 transitions. [2020-10-05 23:42:39,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:42:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1218 transitions. [2020-10-05 23:42:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:39,045 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:39,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:39,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:42:39,045 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1693536000, now seen corresponding path program 1 times [2020-10-05 23:42:39,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:39,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108333431] [2020-10-05 23:42:39,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:39,307 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-05 23:42:39,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108333431] [2020-10-05 23:42:39,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:39,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:39,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486260942] [2020-10-05 23:42:39,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:39,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:39,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:39,310 INFO L87 Difference]: Start difference. First operand 452 states and 1218 transitions. Second operand 8 states. [2020-10-05 23:42:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:39,794 INFO L93 Difference]: Finished difference Result 529 states and 1416 transitions. [2020-10-05 23:42:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:42:39,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 23:42:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:39,799 INFO L225 Difference]: With dead ends: 529 [2020-10-05 23:42:39,800 INFO L226 Difference]: Without dead ends: 529 [2020-10-05 23:42:39,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-05 23:42:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 444. [2020-10-05 23:42:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-05 23:42:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1199 transitions. [2020-10-05 23:42:39,812 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1199 transitions. Word has length 16 [2020-10-05 23:42:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:39,813 INFO L479 AbstractCegarLoop]: Abstraction has 444 states and 1199 transitions. [2020-10-05 23:42:39,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1199 transitions. [2020-10-05 23:42:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:39,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:39,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:39,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:42:39,815 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash -966832439, now seen corresponding path program 5 times [2020-10-05 23:42:39,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:39,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492054437] [2020-10-05 23:42:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,270 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 27 [2020-10-05 23:42:40,305 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-05 23:42:40,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492054437] [2020-10-05 23:42:40,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:42:40,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768940001] [2020-10-05 23:42:40,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:42:40,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:42:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:40,310 INFO L87 Difference]: Start difference. First operand 444 states and 1199 transitions. Second operand 9 states. [2020-10-05 23:42:40,540 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-10-05 23:42:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:41,058 INFO L93 Difference]: Finished difference Result 697 states and 1817 transitions. [2020-10-05 23:42:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:42:41,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 23:42:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:41,062 INFO L225 Difference]: With dead ends: 697 [2020-10-05 23:42:41,062 INFO L226 Difference]: Without dead ends: 465 [2020-10-05 23:42:41,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:42:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-10-05 23:42:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 360. [2020-10-05 23:42:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-10-05 23:42:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 960 transitions. [2020-10-05 23:42:41,079 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 960 transitions. Word has length 16 [2020-10-05 23:42:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:41,080 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 960 transitions. [2020-10-05 23:42:41,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:42:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 960 transitions. [2020-10-05 23:42:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:41,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:41,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:41,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:42:41,082 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash -723485020, now seen corresponding path program 1 times [2020-10-05 23:42:41,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:41,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631777593] [2020-10-05 23:42:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:41,173 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-05 23:42:41,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631777593] [2020-10-05 23:42:41,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:41,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:41,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276266641] [2020-10-05 23:42:41,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:41,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:41,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:41,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:41,175 INFO L87 Difference]: Start difference. First operand 360 states and 960 transitions. Second operand 4 states. [2020-10-05 23:42:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:41,211 INFO L93 Difference]: Finished difference Result 345 states and 814 transitions. [2020-10-05 23:42:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:41,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 23:42:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:41,214 INFO L225 Difference]: With dead ends: 345 [2020-10-05 23:42:41,214 INFO L226 Difference]: Without dead ends: 238 [2020-10-05 23:42:41,215 INFO L675 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-05 23:42:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-10-05 23:42:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2020-10-05 23:42:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-10-05 23:42:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 539 transitions. [2020-10-05 23:42:41,227 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 539 transitions. Word has length 16 [2020-10-05 23:42:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:41,228 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 539 transitions. [2020-10-05 23:42:41,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 539 transitions. [2020-10-05 23:42:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:42:41,232 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:41,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:41,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:42:41,232 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash 233701298, now seen corresponding path program 1 times [2020-10-05 23:42:41,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:41,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396239078] [2020-10-05 23:42:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:41,337 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-05 23:42:41,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396239078] [2020-10-05 23:42:41,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:41,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:41,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215667382] [2020-10-05 23:42:41,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:41,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:41,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:41,339 INFO L87 Difference]: Start difference. First operand 238 states and 539 transitions. Second operand 5 states. [2020-10-05 23:42:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:41,386 INFO L93 Difference]: Finished difference Result 205 states and 420 transitions. [2020-10-05 23:42:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:41,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:42:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:41,388 INFO L225 Difference]: With dead ends: 205 [2020-10-05 23:42:41,389 INFO L226 Difference]: Without dead ends: 153 [2020-10-05 23:42:41,389 INFO L675 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-05 23:42:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-05 23:42:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-10-05 23:42:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:42:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 301 transitions. [2020-10-05 23:42:41,393 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 301 transitions. Word has length 17 [2020-10-05 23:42:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:41,394 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 301 transitions. [2020-10-05 23:42:41,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 301 transitions. [2020-10-05 23:42:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:42:41,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:41,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:41,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:42:41,395 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash -499071186, now seen corresponding path program 1 times [2020-10-05 23:42:41,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:41,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105682545] [2020-10-05 23:42:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:41,507 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-05 23:42:41,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105682545] [2020-10-05 23:42:41,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:41,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:41,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286886257] [2020-10-05 23:42:41,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:41,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:41,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:41,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:41,510 INFO L87 Difference]: Start difference. First operand 153 states and 301 transitions. Second operand 6 states. [2020-10-05 23:42:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:41,556 INFO L93 Difference]: Finished difference Result 138 states and 270 transitions. [2020-10-05 23:42:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:41,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 23:42:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:41,558 INFO L225 Difference]: With dead ends: 138 [2020-10-05 23:42:41,558 INFO L226 Difference]: Without dead ends: 106 [2020-10-05 23:42:41,558 INFO L675 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-05 23:42:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-05 23:42:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2020-10-05 23:42:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-05 23:42:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 192 transitions. [2020-10-05 23:42:41,564 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 192 transitions. Word has length 19 [2020-10-05 23:42:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:41,564 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 192 transitions. [2020-10-05 23:42:41,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 192 transitions. [2020-10-05 23:42:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:41,565 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:41,565 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-05 23:42:41,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:42:41,566 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:41,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:41,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1616105747, now seen corresponding path program 1 times [2020-10-05 23:42:41,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:41,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969299359] [2020-10-05 23:42:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:42,050 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-05 23:42:42,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969299359] [2020-10-05 23:42:42,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:42,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:42:42,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679177071] [2020-10-05 23:42:42,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:42:42,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:42:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:42,052 INFO L87 Difference]: Start difference. First operand 98 states and 192 transitions. Second operand 9 states. [2020-10-05 23:42:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:42,579 INFO L93 Difference]: Finished difference Result 143 states and 276 transitions. [2020-10-05 23:42:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:42:42,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:42:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:42,580 INFO L225 Difference]: With dead ends: 143 [2020-10-05 23:42:42,580 INFO L226 Difference]: Without dead ends: 104 [2020-10-05 23:42:42,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:42:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-05 23:42:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2020-10-05 23:42:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-05 23:42:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 176 transitions. [2020-10-05 23:42:42,584 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 176 transitions. Word has length 21 [2020-10-05 23:42:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:42,584 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 176 transitions. [2020-10-05 23:42:42,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:42:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 176 transitions. [2020-10-05 23:42:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:42,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:42,585 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-05 23:42:42,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:42:42,585 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1929995705, now seen corresponding path program 2 times [2020-10-05 23:42:42,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:42,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957913902] [2020-10-05 23:42:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:42,849 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-05 23:42:42,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957913902] [2020-10-05 23:42:42,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:42,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:42,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774521973] [2020-10-05 23:42:42,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:42,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:42,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:42,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:42,852 INFO L87 Difference]: Start difference. First operand 92 states and 176 transitions. Second operand 6 states. [2020-10-05 23:42:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:43,117 INFO L93 Difference]: Finished difference Result 116 states and 217 transitions. [2020-10-05 23:42:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:43,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:42:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:43,118 INFO L225 Difference]: With dead ends: 116 [2020-10-05 23:42:43,118 INFO L226 Difference]: Without dead ends: 90 [2020-10-05 23:42:43,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-05 23:42:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2020-10-05 23:42:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-05 23:42:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 146 transitions. [2020-10-05 23:42:43,122 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 146 transitions. Word has length 21 [2020-10-05 23:42:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:43,123 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 146 transitions. [2020-10-05 23:42:43,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 146 transitions. [2020-10-05 23:42:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:43,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:43,123 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-05 23:42:43,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:42:43,124 INFO L427 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:43,124 INFO L82 PathProgramCache]: Analyzing trace with hash -503555769, now seen corresponding path program 3 times [2020-10-05 23:42:43,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:43,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184682930] [2020-10-05 23:42:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:43,502 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-05 23:42:43,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184682930] [2020-10-05 23:42:43,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:43,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:43,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703571443] [2020-10-05 23:42:43,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:43,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:43,504 INFO L87 Difference]: Start difference. First operand 80 states and 146 transitions. Second operand 8 states. [2020-10-05 23:42:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:43,854 INFO L93 Difference]: Finished difference Result 106 states and 190 transitions. [2020-10-05 23:42:43,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:43,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-05 23:42:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:43,856 INFO L225 Difference]: With dead ends: 106 [2020-10-05 23:42:43,856 INFO L226 Difference]: Without dead ends: 78 [2020-10-05 23:42:43,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-05 23:42:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2020-10-05 23:42:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-05 23:42:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 136 transitions. [2020-10-05 23:42:43,861 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 136 transitions. Word has length 21 [2020-10-05 23:42:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:43,861 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 136 transitions. [2020-10-05 23:42:43,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 136 transitions. [2020-10-05 23:42:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:43,863 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:43,863 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-05 23:42:43,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 23:42:43,863 INFO L427 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1634451855, now seen corresponding path program 4 times [2020-10-05 23:42:43,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:43,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874066759] [2020-10-05 23:42:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:44,414 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2020-10-05 23:42:44,763 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2020-10-05 23:42:44,930 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-05 23:42:44,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874066759] [2020-10-05 23:42:44,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:44,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 23:42:44,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206603141] [2020-10-05 23:42:44,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 23:42:44,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 23:42:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:42:44,933 INFO L87 Difference]: Start difference. First operand 74 states and 136 transitions. Second operand 13 states. [2020-10-05 23:42:45,903 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-10-05 23:42:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:46,266 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-10-05 23:42:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:42:46,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-05 23:42:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:46,269 INFO L225 Difference]: With dead ends: 152 [2020-10-05 23:42:46,269 INFO L226 Difference]: Without dead ends: 101 [2020-10-05 23:42:46,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-10-05 23:42:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-05 23:42:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2020-10-05 23:42:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-05 23:42:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 141 transitions. [2020-10-05 23:42:46,272 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 141 transitions. Word has length 21 [2020-10-05 23:42:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:46,273 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 141 transitions. [2020-10-05 23:42:46,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 23:42:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 141 transitions. [2020-10-05 23:42:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:46,273 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:46,274 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-05 23:42:46,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:42:46,274 INFO L427 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:46,275 INFO L82 PathProgramCache]: Analyzing trace with hash 769866229, now seen corresponding path program 5 times [2020-10-05 23:42:46,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:46,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204900013] [2020-10-05 23:42:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:46,720 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-05 23:42:46,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204900013] [2020-10-05 23:42:46,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:46,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:46,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564123267] [2020-10-05 23:42:46,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:46,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:46,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:46,722 INFO L87 Difference]: Start difference. First operand 77 states and 141 transitions. Second operand 8 states. [2020-10-05 23:42:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:47,016 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2020-10-05 23:42:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:47,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-05 23:42:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:47,019 INFO L225 Difference]: With dead ends: 101 [2020-10-05 23:42:47,019 INFO L226 Difference]: Without dead ends: 71 [2020-10-05 23:42:47,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-05 23:42:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-10-05 23:42:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-05 23:42:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 107 transitions. [2020-10-05 23:42:47,022 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 107 transitions. Word has length 21 [2020-10-05 23:42:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:47,024 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 107 transitions. [2020-10-05 23:42:47,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 107 transitions. [2020-10-05 23:42:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:47,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:47,027 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-05 23:42:47,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:42:47,028 INFO L427 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash 989167739, now seen corresponding path program 6 times [2020-10-05 23:42:47,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:47,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538818163] [2020-10-05 23:42:47,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:47,473 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-05 23:42:47,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538818163] [2020-10-05 23:42:47,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:47,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:47,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119561135] [2020-10-05 23:42:47,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:47,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:47,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:47,475 INFO L87 Difference]: Start difference. First operand 65 states and 107 transitions. Second operand 7 states. [2020-10-05 23:42:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:47,633 INFO L93 Difference]: Finished difference Result 87 states and 145 transitions. [2020-10-05 23:42:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:47,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:42:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:47,635 INFO L225 Difference]: With dead ends: 87 [2020-10-05 23:42:47,635 INFO L226 Difference]: Without dead ends: 56 [2020-10-05 23:42:47,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-05 23:42:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-05 23:42:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-05 23:42:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 93 transitions. [2020-10-05 23:42:47,637 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 93 transitions. Word has length 21 [2020-10-05 23:42:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:47,637 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 93 transitions. [2020-10-05 23:42:47,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 93 transitions. [2020-10-05 23:42:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:47,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:47,638 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-05 23:42:47,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-05 23:42:47,638 INFO L427 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:47,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:47,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1310019483, now seen corresponding path program 7 times [2020-10-05 23:42:47,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:47,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501273263] [2020-10-05 23:42:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:48,261 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2020-10-05 23:42:48,409 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-10-05 23:42:48,537 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2020-10-05 23:42:48,668 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2020-10-05 23:42:48,868 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-05 23:42:48,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501273263] [2020-10-05 23:42:48,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:48,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 23:42:48,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034100018] [2020-10-05 23:42:48,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 23:42:48,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 23:42:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:42:48,871 INFO L87 Difference]: Start difference. First operand 56 states and 93 transitions. Second operand 13 states. [2020-10-05 23:42:49,027 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-10-05 23:42:49,222 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-10-05 23:42:49,957 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-10-05 23:42:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:50,251 INFO L93 Difference]: Finished difference Result 102 states and 172 transitions. [2020-10-05 23:42:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:42:50,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-05 23:42:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:50,252 INFO L225 Difference]: With dead ends: 102 [2020-10-05 23:42:50,253 INFO L226 Difference]: Without dead ends: 51 [2020-10-05 23:42:50,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-10-05 23:42:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-05 23:42:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2020-10-05 23:42:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-05 23:42:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-10-05 23:42:50,256 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 21 [2020-10-05 23:42:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:50,256 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-10-05 23:42:50,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 23:42:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-10-05 23:42:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:50,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:50,257 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-05 23:42:50,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-05 23:42:50,257 INFO L427 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash -361328219, now seen corresponding path program 8 times [2020-10-05 23:42:50,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:50,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905456932] [2020-10-05 23:42:50,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:50,563 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-05 23:42:50,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905456932] [2020-10-05 23:42:50,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:50,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:50,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111042417] [2020-10-05 23:42:50,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:50,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:50,565 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 7 states. [2020-10-05 23:42:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:50,782 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2020-10-05 23:42:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:50,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:42:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:50,783 INFO L225 Difference]: With dead ends: 67 [2020-10-05 23:42:50,783 INFO L226 Difference]: Without dead ends: 37 [2020-10-05 23:42:50,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-05 23:42:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-05 23:42:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-05 23:42:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-05 23:42:50,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2020-10-05 23:42:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:50,785 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-05 23:42:50,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-10-05 23:42:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:50,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:50,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] [2020-10-05 23:42:50,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-05 23:42:50,786 INFO L427 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:50,786 INFO L82 PathProgramCache]: Analyzing trace with hash 559176997, now seen corresponding path program 9 times [2020-10-05 23:42:50,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:50,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655150146] [2020-10-05 23:42:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:50,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:50,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:50,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:42:50,941 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:42:50,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-05 23:42:50,942 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:42:50,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1649] [1649] L3-->L854: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In-1817466679 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-1817466679 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1817466679 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1817466679 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~x$r_buff1_thd0~0_In-1817466679 ~x$r_buff1_thd0~0_Out-1817466679) (= ~x$r_buff0_thd0~0_Out-1817466679 ~x$r_buff0_thd0~0_In-1817466679) (or (and .cse0 (or (and .cse1 (= ~x~0_In-1817466679 ~x~0_Out-1817466679)) (and .cse2 .cse3 (= ~x~0_Out-1817466679 ~x$w_buff1~0_In-1817466679)))) (and .cse4 .cse5 (= ~x$w_buff0~0_In-1817466679 ~x~0_Out-1817466679))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1817466679 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1817466679| ULTIMATE.start_assume_abort_if_not_~cond_Out-1817466679) (or (and .cse2 (= ~x$w_buff1_used~0_Out-1817466679 0) .cse3) (and (= ~x$w_buff1_used~0_Out-1817466679 ~x$w_buff1_used~0_In-1817466679) .cse1)) (or (and (= ~x$w_buff0_used~0_In-1817466679 ~x$w_buff0_used~0_Out-1817466679) .cse0) (and .cse4 (= ~x$w_buff0_used~0_Out-1817466679 0) .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1817466679, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1817466679, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1817466679|, ~x$w_buff1~0=~x$w_buff1~0_In-1817466679, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1817466679, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1817466679, ~x~0=~x~0_In-1817466679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1817466679} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1817466679, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1817466679, ~x$w_buff1~0=~x$w_buff1~0_In-1817466679, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1817466679, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1817466679|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1817466679, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1817466679, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-1817466679|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1817466679|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1817466679|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-1817466679|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1817466679|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1817466679, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-1817466679|, ~x~0=~x~0_Out-1817466679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite69, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-05 23:42:50,969 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-05 23:42:50,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,971 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-05 23:42:50,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,971 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-05 23:42:50,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,972 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-05 23:42:50,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,972 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-05 23:42:50,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,973 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-05 23:42:50,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,973 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-05 23:42:50,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,974 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-05 23:42:50,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,974 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-05 23:42:50,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,975 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-05 23:42:50,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,975 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-05 23:42:50,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,975 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-05 23:42:50,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,976 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-05 23:42:50,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,977 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-05 23:42:50,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,977 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-05 23:42:50,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,978 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-05 23:42:50,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,978 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-05 23:42:50,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,979 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-05 23:42:50,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:50,979 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-05 23:42:50,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,017 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-05 23:42:51,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,018 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-05 23:42:51,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,018 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-05 23:42:51,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,018 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-05 23:42:51,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,019 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-05 23:42:51,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,019 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-05 23:42:51,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,020 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-05 23:42:51,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,020 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-05 23:42:51,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,023 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-05 23:42:51,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,023 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-05 23:42:51,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,024 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-05 23:42:51,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,024 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-05 23:42:51,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,024 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-05 23:42:51,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,024 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-05 23:42:51,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,024 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-05 23:42:51,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,025 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-05 23:42:51,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,025 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-05 23:42:51,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,025 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-05 23:42:51,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,025 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-05 23:42:51,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,026 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-05 23:42:51,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,026 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-05 23:42:51,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,026 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-05 23:42:51,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,027 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-05 23:42:51,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,027 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-05 23:42:51,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,027 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-05 23:42:51,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,027 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-05 23:42:51,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,028 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-05 23:42:51,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,028 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-05 23:42:51,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,029 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-05 23:42:51,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,029 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-05 23:42:51,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,029 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-05 23:42:51,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,029 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-05 23:42:51,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,030 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-05 23:42:51,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,030 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-05 23:42:51,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,030 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-05 23:42:51,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,031 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-05 23:42:51,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,031 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-05 23:42:51,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,031 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-05 23:42:51,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:51,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:42:51 BasicIcfg [2020-10-05 23:42:51,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:42:51,136 INFO L168 Benchmark]: Toolchain (without parser) took 33155.43 ms. Allocated memory was 140.5 MB in the beginning and 573.0 MB in the end (delta: 432.5 MB). Free memory was 102.3 MB in the beginning and 514.6 MB in the end (delta: -412.3 MB). Peak memory consumption was 445.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:51,138 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:42:51,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.48 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 154.7 MB in the end (delta: -52.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:51,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.27 ms. Allocated memory is still 204.5 MB. Free memory was 154.7 MB in the beginning and 151.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:51,141 INFO L168 Benchmark]: Boogie Preprocessor took 52.15 ms. Allocated memory is still 204.5 MB. Free memory was 151.5 MB in the beginning and 148.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:51,141 INFO L168 Benchmark]: RCFGBuilder took 3819.89 ms. Allocated memory was 204.5 MB in the beginning and 293.6 MB in the end (delta: 89.1 MB). Free memory was 148.3 MB in the beginning and 254.2 MB in the end (delta: -106.0 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:51,142 INFO L168 Benchmark]: TraceAbstraction took 28401.09 ms. Allocated memory was 293.6 MB in the beginning and 573.0 MB in the end (delta: 279.4 MB). Free memory was 251.3 MB in the beginning and 514.6 MB in the end (delta: -263.3 MB). Peak memory consumption was 441.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:51,150 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.25 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.48 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 154.7 MB in the end (delta: -52.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.27 ms. Allocated memory is still 204.5 MB. Free memory was 154.7 MB in the beginning and 151.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.15 ms. Allocated memory is still 204.5 MB. Free memory was 151.5 MB in the beginning and 148.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3819.89 ms. Allocated memory was 204.5 MB in the beginning and 293.6 MB in the end (delta: 89.1 MB). Free memory was 148.3 MB in the beginning and 254.2 MB in the end (delta: -106.0 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28401.09 ms. Allocated memory was 293.6 MB in the beginning and 573.0 MB in the end (delta: 279.4 MB). Free memory was 251.3 MB in the beginning and 514.6 MB in the end (delta: -263.3 MB). Peak memory consumption was 441.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.8s, 100 ProgramPointsBefore, 36 ProgramPointsAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1624 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 801 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4118 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L708] 0 _Bool x$flush_delayed; [L709] 0 int x$mem_tmp; [L710] 0 _Bool x$r_buff0_thd0; [L711] 0 _Bool x$r_buff0_thd1; [L712] 0 _Bool x$r_buff0_thd2; [L713] 0 _Bool x$r_buff0_thd3; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$r_buff1_thd3; [L718] 0 _Bool x$read_delayed; [L719] 0 int *x$read_delayed_var; [L720] 0 int x$w_buff0; [L721] 0 _Bool x$w_buff0_used; [L722] 0 int x$w_buff1; [L723] 0 _Bool x$w_buff1_used; [L725] 0 int y = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2546; [L839] FCALL, FORK 0 pthread_create(&t2546, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2547; [L841] FCALL, FORK 0 pthread_create(&t2547, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2548; [L843] FCALL, FORK 0 pthread_create(&t2548, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] 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) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] 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) [L740] 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) [L741] 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)) [L741] 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)) [L742] 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)) [L742] 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)) [L743] 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)) [L743] 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)) [L744] 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)) [L744] 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)) [L745] 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)) [L745] EXPR 1 !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) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !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) [L745] 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)) [L745] 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)) [L746] 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)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] 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)) [L746] 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)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 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) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] 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) [L764] 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) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 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 [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 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 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 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) [L816] 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) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 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 [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 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 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L787] 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) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] 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) [L787] 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) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 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 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 544 SDtfs, 904 SDslu, 1336 SDs, 0 SdLazy, 2067 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred 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.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 1230 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 123911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...