/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:11:36,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:11:36,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:11:36,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:11:36,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:11:36,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:11:36,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:11:36,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:11:36,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:11:36,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:11:36,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:11:36,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:11:36,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:11:36,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:11:36,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:11:36,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:11:36,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:11:36,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:11:36,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:11:36,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:11:36,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:11:36,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:11:36,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:11:36,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:11:36,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:11:36,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:11:36,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:11:36,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:11:36,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:11:36,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:11:36,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:11:36,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:11:36,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:11:36,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:11:36,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:11:36,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:11:36,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:11:36,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:11:36,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:11:36,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:11:36,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:11:36,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:11:36,859 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:11:36,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:11:36,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:11:36,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:11:36,861 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:11:36,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:11:36,862 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:11:36,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:11:36,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:11:36,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:11:36,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:11:36,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:11:36,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:11:36,863 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:11:36,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:11:36,864 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:11:36,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:11:36,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:11:36,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:11:36,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:11:36,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:11:36,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:11:36,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:11:36,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:11:36,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:11:36,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:11:36,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:11:36,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:11:36,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:11:36,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:11:37,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:11:37,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:11:37,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:11:37,158 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:11:37,158 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:11:37,159 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i [2020-10-16 11:11:37,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1614f8d56/f897cae28d1b4f03a66bcc37cf0cfbe5/FLAGe2790cfba [2020-10-16 11:11:37,797 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:11:37,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i [2020-10-16 11:11:37,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1614f8d56/f897cae28d1b4f03a66bcc37cf0cfbe5/FLAGe2790cfba [2020-10-16 11:11:38,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1614f8d56/f897cae28d1b4f03a66bcc37cf0cfbe5 [2020-10-16 11:11:38,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:11:38,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:11:38,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:11:38,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:11:38,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:11:38,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132a106a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38, skipping insertion in model container [2020-10-16 11:11:38,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:11:38,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:11:38,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:11:38,715 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:11:38,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:11:38,882 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:11:38,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38 WrapperNode [2020-10-16 11:11:38,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:11:38,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:11:38,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:11:38,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:11:38,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:11:38,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:11:38,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:11:38,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:11:38,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... [2020-10-16 11:11:38,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:11:38,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:11:38,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:11:38,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:11:38,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 11:11:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:11:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:11:39,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:11:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:11:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:11:39,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:11:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:11:39,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:11:39,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:11:39,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:11:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:11:39,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:11:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:11:39,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:11:39,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:11:39,062 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:11:40,843 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:11:40,844 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:11:40,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:11:40 BoogieIcfgContainer [2020-10-16 11:11:40,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:11:40,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:11:40,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:11:40,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:11:40,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:11:38" (1/3) ... [2020-10-16 11:11:40,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcfa754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:11:40, skipping insertion in model container [2020-10-16 11:11:40,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:38" (2/3) ... [2020-10-16 11:11:40,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcfa754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:11:40, skipping insertion in model container [2020-10-16 11:11:40,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:11:40" (3/3) ... [2020-10-16 11:11:40,876 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_pso.opt.i [2020-10-16 11:11:40,887 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:11:40,888 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:11:40,895 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:11:40,896 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:11:40,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,930 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,931 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,935 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,948 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,948 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,948 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,949 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,961 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,961 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,967 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,973 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,974 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,975 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:40,979 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:11:40,993 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:11:41,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:11:41,016 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:11:41,016 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:11:41,016 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:11:41,016 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:11:41,017 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:11:41,018 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:11:41,018 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:11:41,039 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:11:41,043 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-16 11:11:41,046 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-16 11:11:41,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 11:11:41,137 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 11:11:41,138 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:11:41,148 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 11:11:41,156 INFO L117 LiptonReduction]: Number of co-enabled transitions 2432 [2020-10-16 11:11:41,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:41,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:41,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:41,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:41,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:41,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:41,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:41,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:41,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:41,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:41,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:41,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:41,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:41,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:41,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:41,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:41,984 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 11:11:42,098 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 11:11:42,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:11:42,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:11:42,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:42,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:42,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:42,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,469 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 11:11:42,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:42,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:42,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:42,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:11:42,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:11:42,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:42,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:42,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:42,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:42,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:42,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:42,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:42,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:42,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:42,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:42,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:42,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:42,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:42,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:42,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:42,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:42,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:11:42,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:11:42,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:42,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:42,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:42,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:42,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:42,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:42,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:43,458 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 11:11:43,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:43,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:43,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:43,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:43,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:43,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:43,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:43,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:43,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:43,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:43,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:43,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:43,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:43,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:43,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:11:43,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:11:43,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:45,201 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 11:11:45,382 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 11:11:45,601 INFO L132 LiptonReduction]: Checked pairs total: 5891 [2020-10-16 11:11:45,601 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 11:11:45,608 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-16 11:11:45,752 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2410 states. [2020-10-16 11:11:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states. [2020-10-16 11:11:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 11:11:45,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:45,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:45,766 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1749114566, now seen corresponding path program 1 times [2020-10-16 11:11:45,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:45,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754616717] [2020-10-16 11:11:45,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:46,035 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-16 11:11:46,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754616717] [2020-10-16 11:11:46,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:46,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:11:46,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514106059] [2020-10-16 11:11:46,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:11:46,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:46,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:11:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:46,062 INFO L87 Difference]: Start difference. First operand 2410 states. Second operand 3 states. [2020-10-16 11:11:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:46,163 INFO L93 Difference]: Finished difference Result 2090 states and 7968 transitions. [2020-10-16 11:11:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:11:46,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 11:11:46,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:46,266 INFO L225 Difference]: With dead ends: 2090 [2020-10-16 11:11:46,266 INFO L226 Difference]: Without dead ends: 1706 [2020-10-16 11:11:46,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-10-16 11:11:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2020-10-16 11:11:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2020-10-16 11:11:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 6400 transitions. [2020-10-16 11:11:46,433 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 6400 transitions. Word has length 9 [2020-10-16 11:11:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:46,434 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 6400 transitions. [2020-10-16 11:11:46,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:11:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 6400 transitions. [2020-10-16 11:11:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:11:46,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:46,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:46,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:11:46,440 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:46,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1566846539, now seen corresponding path program 1 times [2020-10-16 11:11:46,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:46,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497444559] [2020-10-16 11:11:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:46,592 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-16 11:11:46,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497444559] [2020-10-16 11:11:46,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:46,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:11:46,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342781881] [2020-10-16 11:11:46,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:11:46,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:46,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:11:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:46,596 INFO L87 Difference]: Start difference. First operand 1706 states and 6400 transitions. Second operand 3 states. [2020-10-16 11:11:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:46,620 INFO L93 Difference]: Finished difference Result 1578 states and 5856 transitions. [2020-10-16 11:11:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:11:46,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 11:11:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:46,635 INFO L225 Difference]: With dead ends: 1578 [2020-10-16 11:11:46,636 INFO L226 Difference]: Without dead ends: 1578 [2020-10-16 11:11:46,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2020-10-16 11:11:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2020-10-16 11:11:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-10-16 11:11:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 5856 transitions. [2020-10-16 11:11:46,699 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 5856 transitions. Word has length 11 [2020-10-16 11:11:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:46,699 INFO L481 AbstractCegarLoop]: Abstraction has 1578 states and 5856 transitions. [2020-10-16 11:11:46,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:11:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 5856 transitions. [2020-10-16 11:11:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:11:46,704 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:46,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:46,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:11:46,704 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1793977970, now seen corresponding path program 1 times [2020-10-16 11:11:46,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:46,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054913756] [2020-10-16 11:11:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:46,822 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-16 11:11:46,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054913756] [2020-10-16 11:11:46,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:46,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:11:46,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336719718] [2020-10-16 11:11:46,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:11:46,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:11:46,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:46,825 INFO L87 Difference]: Start difference. First operand 1578 states and 5856 transitions. Second operand 3 states. [2020-10-16 11:11:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:46,870 INFO L93 Difference]: Finished difference Result 1546 states and 5712 transitions. [2020-10-16 11:11:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:11:46,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 11:11:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:46,884 INFO L225 Difference]: With dead ends: 1546 [2020-10-16 11:11:46,885 INFO L226 Difference]: Without dead ends: 1546 [2020-10-16 11:11:46,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-10-16 11:11:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2020-10-16 11:11:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2020-10-16 11:11:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 5712 transitions. [2020-10-16 11:11:46,944 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 5712 transitions. Word has length 13 [2020-10-16 11:11:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:46,945 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 5712 transitions. [2020-10-16 11:11:46,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:11:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 5712 transitions. [2020-10-16 11:11:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:11:46,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:46,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:46,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:11:46,948 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1439826351, now seen corresponding path program 1 times [2020-10-16 11:11:46,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:46,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550937104] [2020-10-16 11:11:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:47,048 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-16 11:11:47,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550937104] [2020-10-16 11:11:47,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:47,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:11:47,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178858576] [2020-10-16 11:11:47,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:11:47,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:47,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:11:47,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:11:47,051 INFO L87 Difference]: Start difference. First operand 1546 states and 5712 transitions. Second operand 4 states. [2020-10-16 11:11:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:47,112 INFO L93 Difference]: Finished difference Result 1597 states and 5366 transitions. [2020-10-16 11:11:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:11:47,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 11:11:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:47,122 INFO L225 Difference]: With dead ends: 1597 [2020-10-16 11:11:47,122 INFO L226 Difference]: Without dead ends: 1213 [2020-10-16 11:11:47,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:11:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-10-16 11:11:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2020-10-16 11:11:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2020-10-16 11:11:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 4047 transitions. [2020-10-16 11:11:47,165 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 4047 transitions. Word has length 14 [2020-10-16 11:11:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:47,165 INFO L481 AbstractCegarLoop]: Abstraction has 1213 states and 4047 transitions. [2020-10-16 11:11:47,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:11:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 4047 transitions. [2020-10-16 11:11:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:11:47,168 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:47,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:47,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:11:47,168 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1866357709, now seen corresponding path program 1 times [2020-10-16 11:11:47,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:47,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24228768] [2020-10-16 11:11:47,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:47,254 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-16 11:11:47,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24228768] [2020-10-16 11:11:47,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:47,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:11:47,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794858071] [2020-10-16 11:11:47,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:11:47,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:11:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:11:47,257 INFO L87 Difference]: Start difference. First operand 1213 states and 4047 transitions. Second operand 5 states. [2020-10-16 11:11:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:47,319 INFO L93 Difference]: Finished difference Result 1042 states and 3173 transitions. [2020-10-16 11:11:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:11:47,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 11:11:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:47,326 INFO L225 Difference]: With dead ends: 1042 [2020-10-16 11:11:47,326 INFO L226 Difference]: Without dead ends: 793 [2020-10-16 11:11:47,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:11:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-10-16 11:11:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2020-10-16 11:11:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-10-16 11:11:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2367 transitions. [2020-10-16 11:11:47,351 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 2367 transitions. Word has length 16 [2020-10-16 11:11:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:47,352 INFO L481 AbstractCegarLoop]: Abstraction has 793 states and 2367 transitions. [2020-10-16 11:11:47,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:11:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 2367 transitions. [2020-10-16 11:11:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:11:47,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:47,354 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-16 11:11:47,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:11:47,355 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash 54611181, now seen corresponding path program 1 times [2020-10-16 11:11:47,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:47,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994356338] [2020-10-16 11:11:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:47,419 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-16 11:11:47,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994356338] [2020-10-16 11:11:47,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:47,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:11:47,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154681012] [2020-10-16 11:11:47,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:11:47,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:47,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:11:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:11:47,422 INFO L87 Difference]: Start difference. First operand 793 states and 2367 transitions. Second operand 4 states. [2020-10-16 11:11:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:47,443 INFO L93 Difference]: Finished difference Result 1109 states and 3220 transitions. [2020-10-16 11:11:47,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:11:47,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-16 11:11:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:47,449 INFO L225 Difference]: With dead ends: 1109 [2020-10-16 11:11:47,449 INFO L226 Difference]: Without dead ends: 811 [2020-10-16 11:11:47,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:11:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-10-16 11:11:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 793. [2020-10-16 11:11:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-10-16 11:11:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2249 transitions. [2020-10-16 11:11:47,474 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 2249 transitions. Word has length 19 [2020-10-16 11:11:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:47,474 INFO L481 AbstractCegarLoop]: Abstraction has 793 states and 2249 transitions. [2020-10-16 11:11:47,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:11:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 2249 transitions. [2020-10-16 11:11:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:11:47,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:47,512 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-16 11:11:47,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:11:47,513 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1687033143, now seen corresponding path program 1 times [2020-10-16 11:11:47,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:47,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433913099] [2020-10-16 11:11:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:47,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433913099] [2020-10-16 11:11:47,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:47,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:11:47,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126034183] [2020-10-16 11:11:47,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:11:47,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:11:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:47,611 INFO L87 Difference]: Start difference. First operand 793 states and 2249 transitions. Second operand 3 states. [2020-10-16 11:11:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:47,626 INFO L93 Difference]: Finished difference Result 1113 states and 3039 transitions. [2020-10-16 11:11:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:11:47,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-16 11:11:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:47,632 INFO L225 Difference]: With dead ends: 1113 [2020-10-16 11:11:47,633 INFO L226 Difference]: Without dead ends: 803 [2020-10-16 11:11:47,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-10-16 11:11:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 785. [2020-10-16 11:11:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-10-16 11:11:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2102 transitions. [2020-10-16 11:11:47,657 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2102 transitions. Word has length 19 [2020-10-16 11:11:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:47,658 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 2102 transitions. [2020-10-16 11:11:47,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:11:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2102 transitions. [2020-10-16 11:11:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:11:47,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:47,660 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-16 11:11:47,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:11:47,660 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1063520327, now seen corresponding path program 1 times [2020-10-16 11:11:47,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:47,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077870754] [2020-10-16 11:11:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:47,790 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-16 11:11:47,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077870754] [2020-10-16 11:11:47,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:47,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:11:47,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768511494] [2020-10-16 11:11:47,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:11:47,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:47,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:11:47,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:11:47,793 INFO L87 Difference]: Start difference. First operand 785 states and 2102 transitions. Second operand 6 states. [2020-10-16 11:11:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:47,864 INFO L93 Difference]: Finished difference Result 683 states and 1783 transitions. [2020-10-16 11:11:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:11:47,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 11:11:47,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:47,868 INFO L225 Difference]: With dead ends: 683 [2020-10-16 11:11:47,869 INFO L226 Difference]: Without dead ends: 548 [2020-10-16 11:11:47,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:11:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-16 11:11:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-16 11:11:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-16 11:11:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1413 transitions. [2020-10-16 11:11:47,884 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1413 transitions. Word has length 19 [2020-10-16 11:11:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:47,884 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1413 transitions. [2020-10-16 11:11:47,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:11:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1413 transitions. [2020-10-16 11:11:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:11:47,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:47,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:47,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:11:47,887 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash 672001859, now seen corresponding path program 1 times [2020-10-16 11:11:47,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:47,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010501931] [2020-10-16 11:11:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:48,006 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-16 11:11:48,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010501931] [2020-10-16 11:11:48,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:48,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:11:48,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568453414] [2020-10-16 11:11:48,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:11:48,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:11:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:11:48,008 INFO L87 Difference]: Start difference. First operand 548 states and 1413 transitions. Second operand 7 states. [2020-10-16 11:11:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:48,078 INFO L93 Difference]: Finished difference Result 524 states and 1365 transitions. [2020-10-16 11:11:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:11:48,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-16 11:11:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:48,080 INFO L225 Difference]: With dead ends: 524 [2020-10-16 11:11:48,080 INFO L226 Difference]: Without dead ends: 209 [2020-10-16 11:11:48,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:11:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-16 11:11:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-16 11:11:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-16 11:11:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 505 transitions. [2020-10-16 11:11:48,087 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 505 transitions. Word has length 22 [2020-10-16 11:11:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:48,087 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 505 transitions. [2020-10-16 11:11:48,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:11:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 505 transitions. [2020-10-16 11:11:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 11:11:48,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:48,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:48,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:11:48,089 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1863618656, now seen corresponding path program 1 times [2020-10-16 11:11:48,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:48,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464037427] [2020-10-16 11:11:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:48,140 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-16 11:11:48,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464037427] [2020-10-16 11:11:48,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:48,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:11:48,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20466940] [2020-10-16 11:11:48,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:11:48,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:48,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:11:48,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:11:48,142 INFO L87 Difference]: Start difference. First operand 209 states and 505 transitions. Second operand 4 states. [2020-10-16 11:11:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:48,157 INFO L93 Difference]: Finished difference Result 274 states and 654 transitions. [2020-10-16 11:11:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:11:48,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-16 11:11:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:48,158 INFO L225 Difference]: With dead ends: 274 [2020-10-16 11:11:48,158 INFO L226 Difference]: Without dead ends: 80 [2020-10-16 11:11:48,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:11:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-16 11:11:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-16 11:11:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-16 11:11:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 166 transitions. [2020-10-16 11:11:48,161 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 166 transitions. Word has length 25 [2020-10-16 11:11:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:48,162 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 166 transitions. [2020-10-16 11:11:48,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:11:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 166 transitions. [2020-10-16 11:11:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 11:11:48,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:48,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:48,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:11:48,163 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1080705768, now seen corresponding path program 2 times [2020-10-16 11:11:48,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:48,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278163686] [2020-10-16 11:11:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:11:48,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:11:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:11:48,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:11:48,275 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:11:48,276 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:11:48,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:11:48,277 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 11:11:48,294 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L2-->L863: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In-1748714094 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-1748714094 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-1748714094 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-1748714094 256) 0))) (let ((.cse3 (not .cse8)) (.cse4 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 .cse1 (= ~z$w_buff0~0_In-1748714094 ~z~0_Out-1748714094)) (and .cse2 (or (and .cse3 .cse4 (= ~z$w_buff1~0_In-1748714094 ~z~0_Out-1748714094)) (and (= ~z~0_In-1748714094 ~z~0_Out-1748714094) .cse5)))) (or (and .cse3 (= ~z$w_buff1_used~0_Out-1748714094 0) .cse4) (and (= ~z$w_buff1_used~0_Out-1748714094 ~z$w_buff1_used~0_In-1748714094) .cse5)) (= ~z$r_buff1_thd0~0_In-1748714094 ~z$r_buff1_thd0~0_Out-1748714094) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1748714094| ULTIMATE.start_assume_abort_if_not_~cond_Out-1748714094) (= ~z$r_buff0_thd0~0_Out-1748714094 ~z$r_buff0_thd0~0_In-1748714094) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1748714094 0)) (or (and .cse2 (= ~z$w_buff0_used~0_In-1748714094 ~z$w_buff0_used~0_Out-1748714094)) (and .cse0 .cse1 (= 0 ~z$w_buff0_used~0_Out-1748714094)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1748714094|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1748714094, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1748714094, ~z$w_buff0~0=~z$w_buff0~0_In-1748714094, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1748714094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1748714094, ~z$w_buff1~0=~z$w_buff1~0_In-1748714094, ~z~0=~z~0_In-1748714094} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1748714094, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1748714094|, ~z$w_buff0~0=~z$w_buff0~0_In-1748714094, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1748714094, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1748714094|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1748714094|, ~z$w_buff1~0=~z$w_buff1~0_In-1748714094, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1748714094|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1748714094|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1748714094|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1748714094, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1748714094|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1748714094, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1748714094, ~z~0=~z~0_Out-1748714094} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2020-10-16 11:11:48,301 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-16 11:11:48,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,304 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-16 11:11:48,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,304 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-16 11:11:48,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,305 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-16 11:11:48,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,307 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-16 11:11:48,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,308 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-16 11:11:48,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,308 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-16 11:11:48,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,308 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-16 11:11:48,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,309 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-16 11:11:48,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,309 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-16 11:11:48,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,309 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-16 11:11:48,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,310 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-16 11:11:48,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,312 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-16 11:11:48,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,312 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-16 11:11:48,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,313 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-16 11:11:48,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,313 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-16 11:11:48,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,313 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-16 11:11:48,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:48,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:11:48 BasicIcfg [2020-10-16 11:11:48,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:11:48,420 INFO L168 Benchmark]: Toolchain (without parser) took 10358.04 ms. Allocated memory was 141.0 MB in the beginning and 364.9 MB in the end (delta: 223.9 MB). Free memory was 101.0 MB in the beginning and 169.3 MB in the end (delta: -68.4 MB). Peak memory consumption was 155.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:48,421 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:11:48,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.75 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 100.8 MB in the beginning and 157.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:48,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:48,423 INFO L168 Benchmark]: Boogie Preprocessor took 39.07 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:48,424 INFO L168 Benchmark]: RCFGBuilder took 1859.78 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 151.7 MB in the beginning and 83.9 MB in the end (delta: 67.9 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:48,425 INFO L168 Benchmark]: TraceAbstraction took 7551.39 ms. Allocated memory was 246.4 MB in the beginning and 364.9 MB in the end (delta: 118.5 MB). Free memory was 214.4 MB in the beginning and 169.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:48,429 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.24 ms. Allocated memory is still 141.0 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.75 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 100.8 MB in the beginning and 157.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.07 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1859.78 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 151.7 MB in the beginning and 83.9 MB in the end (delta: 67.9 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7551.39 ms. Allocated memory was 246.4 MB in the beginning and 364.9 MB in the end (delta: 118.5 MB). Free memory was 214.4 MB in the beginning and 169.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1542 VarBasedMoverChecksPositive, 79 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 171 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 123 PlacesBefore, 44 PlacesAfterwards, 112 TransitionsBefore, 31 TransitionsAfterwards, 2432 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5891 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L845] 0 pthread_t t981; [L846] FCALL, FORK 0 pthread_create(&t981, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t982; [L848] FCALL, FORK 0 pthread_create(&t982, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t983; [L850] FCALL, FORK 0 pthread_create(&t983, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 pthread_t t984; [L852] FCALL, FORK 0 pthread_create(&t984, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff1 = z$w_buff0 [L802] 4 z$w_buff0 = 1 [L803] 4 z$w_buff1_used = z$w_buff0_used [L804] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 a = 1 [L817] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0 [L781] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = z [L788] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L788] 3 z = z$flush_delayed ? z$mem_tmp : z [L789] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L827] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 4 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 325 SDtfs, 319 SDslu, 472 SDs, 0 SdLazy, 178 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred 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, 10 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 7107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...