/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/safe017_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:51:11,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:51:11,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:51:11,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:51:11,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:51:11,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:51:11,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:51:11,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:51:11,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:51:11,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:51:11,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:51:11,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:51:11,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:51:11,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:51:11,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:51:11,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:51:11,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:51:11,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:51:11,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:51:11,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:51:11,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:51:11,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:51:11,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:51:11,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:51:11,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:51:11,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:51:11,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:51:11,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:51:11,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:51:11,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:51:11,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:51:11,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:51:11,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:51:11,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:51:11,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:51:11,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:51:11,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:51:11,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:51:11,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:51:11,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:51:11,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:51:11,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:51:11,871 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:51:11,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:51:11,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:51:11,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:51:11,873 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:51:11,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:51:11,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:51:11,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:51:11,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:51:11,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:51:11,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:51:11,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:51:11,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:51:11,875 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:51:11,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:51:11,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:51:11,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:51:11,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:51:11,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:51:11,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:51:11,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:51:11,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:51:11,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:51:11,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:51:11,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:51:11,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:51:11,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:51:11,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:51:11,878 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:51:11,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:51:12,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:51:12,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:51:12,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:51:12,159 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:51:12,160 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:51:12,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-26 23:51:12,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9540d9a5/ea81f99190f448c0a85869fbecc929f9/FLAG77e489f01 [2019-12-26 23:51:12,766 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:51:12,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-26 23:51:12,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9540d9a5/ea81f99190f448c0a85869fbecc929f9/FLAG77e489f01 [2019-12-26 23:51:13,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9540d9a5/ea81f99190f448c0a85869fbecc929f9 [2019-12-26 23:51:13,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:51:13,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:51:13,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:51:13,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:51:13,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:51:13,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13, skipping insertion in model container [2019-12-26 23:51:13,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:51:13,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:51:13,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:51:13,674 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:51:13,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:51:13,863 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:51:13,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13 WrapperNode [2019-12-26 23:51:13,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:51:13,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:51:13,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:51:13,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:51:13,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:51:13,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:51:13,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:51:13,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:51:13,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... [2019-12-26 23:51:13,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:51:13,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:51:13,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:51:13,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:51:13,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:51:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:51:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:51:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:51:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:51:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:51:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:51:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:51:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:51:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:51:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:51:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:51:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:51:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:51:14,065 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:51:14,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:51:14,890 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:51:14,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:51:14 BoogieIcfgContainer [2019-12-26 23:51:14,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:51:14,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:51:14,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:51:14,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:51:14,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:51:13" (1/3) ... [2019-12-26 23:51:14,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d489b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:51:14, skipping insertion in model container [2019-12-26 23:51:14,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:51:13" (2/3) ... [2019-12-26 23:51:14,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d489b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:51:14, skipping insertion in model container [2019-12-26 23:51:14,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:51:14" (3/3) ... [2019-12-26 23:51:14,901 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_rmo.oepc.i [2019-12-26 23:51:14,911 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:51:14,912 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:51:14,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:51:14,921 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:51:14,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:14,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,005 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,009 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,010 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,013 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,014 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:51:15,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:51:15,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:51:15,052 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:51:15,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:51:15,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:51:15,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:51:15,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:51:15,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:51:15,053 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:51:15,070 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-26 23:51:15,072 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-26 23:51:15,181 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-26 23:51:15,181 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:51:15,200 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:51:15,225 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-26 23:51:15,280 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-26 23:51:15,280 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:51:15,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:51:15,309 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:51:15,310 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:51:20,544 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:51:20,669 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:51:20,699 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-26 23:51:20,699 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 23:51:20,703 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-26 23:51:36,469 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-26 23:51:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-26 23:51:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:51:36,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:36,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:51:36,477 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:51:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-26 23:51:36,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:36,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495628047] [2019-12-26 23:51:36,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:51:36,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495628047] [2019-12-26 23:51:36,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:36,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:51:36,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237736565] [2019-12-26 23:51:36,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:51:36,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:51:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:51:36,730 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-26 23:51:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:37,909 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-26 23:51:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:51:37,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:51:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:41,701 INFO L225 Difference]: With dead ends: 112536 [2019-12-26 23:51:41,701 INFO L226 Difference]: Without dead ends: 110184 [2019-12-26 23:51:41,703 INFO L631 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 [2019-12-26 23:51:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-26 23:51:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-26 23:51:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-26 23:51:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-26 23:51:48,582 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-26 23:51:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:51:48,583 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-26 23:51:48,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:51:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-26 23:51:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:51:48,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:51:48,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:51:48,588 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:51:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:51:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-26 23:51:48,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:51:48,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574656274] [2019-12-26 23:51:48,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:51:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:51:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:51:48,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574656274] [2019-12-26 23:51:48,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:51:48,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:51:48,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930042871] [2019-12-26 23:51:48,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:51:48,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:51:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:51:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:51:48,735 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-26 23:51:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:51:54,145 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-26 23:51:54,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:51:54,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:51:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:51:54,834 INFO L225 Difference]: With dead ends: 172298 [2019-12-26 23:51:54,834 INFO L226 Difference]: Without dead ends: 172249 [2019-12-26 23:51:54,835 INFO L631 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 [2019-12-26 23:51:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-26 23:52:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-26 23:52:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-26 23:52:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-26 23:52:10,799 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-26 23:52:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:10,800 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-26 23:52:10,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:52:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-26 23:52:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:52:10,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:10,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:10,806 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-26 23:52:10,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:10,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902007998] [2019-12-26 23:52:10,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:10,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902007998] [2019-12-26 23:52:10,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:10,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:10,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727068616] [2019-12-26 23:52:10,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:10,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:10,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:10,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:10,909 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-26 23:52:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:11,040 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-26 23:52:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:11,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:52:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:11,111 INFO L225 Difference]: With dead ends: 32129 [2019-12-26 23:52:11,112 INFO L226 Difference]: Without dead ends: 32129 [2019-12-26 23:52:11,112 INFO L631 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 [2019-12-26 23:52:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-26 23:52:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-26 23:52:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-26 23:52:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-26 23:52:11,892 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-26 23:52:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:11,892 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-26 23:52:11,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-26 23:52:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:52:11,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:11,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:11,894 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-26 23:52:11,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:11,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912359220] [2019-12-26 23:52:11,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:12,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912359220] [2019-12-26 23:52:12,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:12,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:12,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636655912] [2019-12-26 23:52:12,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:52:12,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:12,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:52:12,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:52:12,024 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-26 23:52:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:12,466 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-26 23:52:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:52:12,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:52:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:12,537 INFO L225 Difference]: With dead ends: 43159 [2019-12-26 23:52:12,537 INFO L226 Difference]: Without dead ends: 43152 [2019-12-26 23:52:12,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-26 23:52:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-26 23:52:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-26 23:52:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-26 23:52:15,893 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-26 23:52:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:15,893 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-26 23:52:15,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:52:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-26 23:52:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:52:15,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:15,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:15,899 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-26 23:52:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:15,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479163261] [2019-12-26 23:52:15,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:16,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479163261] [2019-12-26 23:52:16,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:16,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:52:16,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774567048] [2019-12-26 23:52:16,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:16,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:16,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:16,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:16,003 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 5 states. [2019-12-26 23:52:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:16,791 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-26 23:52:16,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:52:16,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:52:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:16,875 INFO L225 Difference]: With dead ends: 50788 [2019-12-26 23:52:16,875 INFO L226 Difference]: Without dead ends: 50775 [2019-12-26 23:52:16,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:52:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-26 23:52:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-26 23:52:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-26 23:52:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-26 23:52:17,628 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-26 23:52:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:17,629 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-26 23:52:17,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-26 23:52:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:52:17,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:17,643 INFO L411 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] [2019-12-26 23:52:17,643 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-26 23:52:17,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:17,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096806687] [2019-12-26 23:52:17,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:17,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096806687] [2019-12-26 23:52:17,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:17,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:52:17,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860700388] [2019-12-26 23:52:17,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:52:17,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:17,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:52:17,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:52:17,705 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 4 states. [2019-12-26 23:52:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:17,746 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-26 23:52:17,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:52:17,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:52:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:17,757 INFO L225 Difference]: With dead ends: 7382 [2019-12-26 23:52:17,758 INFO L226 Difference]: Without dead ends: 7382 [2019-12-26 23:52:17,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:52:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-26 23:52:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-26 23:52:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-26 23:52:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-26 23:52:17,857 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-26 23:52:17,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:17,857 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-26 23:52:17,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:52:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-26 23:52:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:52:17,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:17,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:17,870 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:17,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-26 23:52:17,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:17,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250822576] [2019-12-26 23:52:17,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:17,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250822576] [2019-12-26 23:52:17,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:17,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:52:17,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319438738] [2019-12-26 23:52:17,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:17,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:17,970 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 5 states. [2019-12-26 23:52:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:18,013 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-26 23:52:18,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:52:18,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:52:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:18,022 INFO L225 Difference]: With dead ends: 5311 [2019-12-26 23:52:18,022 INFO L226 Difference]: Without dead ends: 5311 [2019-12-26 23:52:18,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-26 23:52:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-26 23:52:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-26 23:52:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-26 23:52:18,360 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-26 23:52:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:18,360 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-26 23:52:18,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-26 23:52:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:18,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:18,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:18,369 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-26 23:52:18,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:18,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073616441] [2019-12-26 23:52:18,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:18,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073616441] [2019-12-26 23:52:18,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:18,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:52:18,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108149903] [2019-12-26 23:52:18,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:18,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:18,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:18,444 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-26 23:52:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:18,497 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-26 23:52:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:18,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:52:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:18,506 INFO L225 Difference]: With dead ends: 4958 [2019-12-26 23:52:18,506 INFO L226 Difference]: Without dead ends: 4958 [2019-12-26 23:52:18,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-26 23:52:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-26 23:52:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-26 23:52:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-26 23:52:18,577 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-26 23:52:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:18,578 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-26 23:52:18,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-26 23:52:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:52:18,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:18,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:18,586 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-26 23:52:18,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:18,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335824454] [2019-12-26 23:52:18,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:18,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335824454] [2019-12-26 23:52:18,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:18,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:18,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898821195] [2019-12-26 23:52:18,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:18,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:18,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:18,686 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 3 states. [2019-12-26 23:52:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:18,714 INFO L93 Difference]: Finished difference Result 4666 states and 13243 transitions. [2019-12-26 23:52:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:18,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:52:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:18,722 INFO L225 Difference]: With dead ends: 4666 [2019-12-26 23:52:18,722 INFO L226 Difference]: Without dead ends: 4666 [2019-12-26 23:52:18,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-12-26 23:52:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2019-12-26 23:52:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-26 23:52:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13243 transitions. [2019-12-26 23:52:18,787 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13243 transitions. Word has length 65 [2019-12-26 23:52:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:18,787 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13243 transitions. [2019-12-26 23:52:18,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13243 transitions. [2019-12-26 23:52:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:18,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:18,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:18,794 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash -707320023, now seen corresponding path program 1 times [2019-12-26 23:52:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:18,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554791641] [2019-12-26 23:52:18,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:18,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554791641] [2019-12-26 23:52:18,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:18,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:52:18,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447179758] [2019-12-26 23:52:18,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:18,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:18,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:18,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:18,887 INFO L87 Difference]: Start difference. First operand 4666 states and 13243 transitions. Second operand 5 states. [2019-12-26 23:52:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:19,158 INFO L93 Difference]: Finished difference Result 7090 states and 19974 transitions. [2019-12-26 23:52:19,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:52:19,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:52:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:19,168 INFO L225 Difference]: With dead ends: 7090 [2019-12-26 23:52:19,168 INFO L226 Difference]: Without dead ends: 7090 [2019-12-26 23:52:19,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-26 23:52:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5825. [2019-12-26 23:52:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-12-26 23:52:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 16556 transitions. [2019-12-26 23:52:19,247 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 16556 transitions. Word has length 66 [2019-12-26 23:52:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:19,247 INFO L462 AbstractCegarLoop]: Abstraction has 5825 states and 16556 transitions. [2019-12-26 23:52:19,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 16556 transitions. [2019-12-26 23:52:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:19,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:19,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:19,255 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash 429063715, now seen corresponding path program 2 times [2019-12-26 23:52:19,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:19,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408948749] [2019-12-26 23:52:19,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:19,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408948749] [2019-12-26 23:52:19,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:19,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:52:19,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184039540] [2019-12-26 23:52:19,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:52:19,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:52:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:52:19,375 INFO L87 Difference]: Start difference. First operand 5825 states and 16556 transitions. Second operand 5 states. [2019-12-26 23:52:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:19,701 INFO L93 Difference]: Finished difference Result 8400 states and 23631 transitions. [2019-12-26 23:52:19,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:52:19,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:52:19,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:19,712 INFO L225 Difference]: With dead ends: 8400 [2019-12-26 23:52:19,712 INFO L226 Difference]: Without dead ends: 8400 [2019-12-26 23:52:19,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:52:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2019-12-26 23:52:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 6173. [2019-12-26 23:52:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6173 states. [2019-12-26 23:52:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 17589 transitions. [2019-12-26 23:52:19,809 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 17589 transitions. Word has length 66 [2019-12-26 23:52:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:19,809 INFO L462 AbstractCegarLoop]: Abstraction has 6173 states and 17589 transitions. [2019-12-26 23:52:19,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:52:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 17589 transitions. [2019-12-26 23:52:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:19,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:19,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:19,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:19,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:19,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2071652769, now seen corresponding path program 3 times [2019-12-26 23:52:19,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:19,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569354130] [2019-12-26 23:52:19,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:19,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569354130] [2019-12-26 23:52:19,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:19,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:52:19,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278783266] [2019-12-26 23:52:19,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:52:19,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:52:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:52:19,944 INFO L87 Difference]: Start difference. First operand 6173 states and 17589 transitions. Second operand 6 states. [2019-12-26 23:52:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:20,476 INFO L93 Difference]: Finished difference Result 8757 states and 24595 transitions. [2019-12-26 23:52:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:52:20,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 23:52:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:20,488 INFO L225 Difference]: With dead ends: 8757 [2019-12-26 23:52:20,488 INFO L226 Difference]: Without dead ends: 8757 [2019-12-26 23:52:20,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:52:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2019-12-26 23:52:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 6362. [2019-12-26 23:52:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6362 states. [2019-12-26 23:52:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 18145 transitions. [2019-12-26 23:52:20,588 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 18145 transitions. Word has length 66 [2019-12-26 23:52:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:20,589 INFO L462 AbstractCegarLoop]: Abstraction has 6362 states and 18145 transitions. [2019-12-26 23:52:20,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:52:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 18145 transitions. [2019-12-26 23:52:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:52:20,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:20,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:20,598 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1231010579, now seen corresponding path program 4 times [2019-12-26 23:52:20,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:20,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566236381] [2019-12-26 23:52:20,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:20,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566236381] [2019-12-26 23:52:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:20,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:20,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942792089] [2019-12-26 23:52:20,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:20,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:20,678 INFO L87 Difference]: Start difference. First operand 6362 states and 18145 transitions. Second operand 3 states. [2019-12-26 23:52:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:20,710 INFO L93 Difference]: Finished difference Result 5743 states and 16114 transitions. [2019-12-26 23:52:20,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:20,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:52:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:20,718 INFO L225 Difference]: With dead ends: 5743 [2019-12-26 23:52:20,719 INFO L226 Difference]: Without dead ends: 5743 [2019-12-26 23:52:20,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2019-12-26 23:52:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 5743. [2019-12-26 23:52:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5743 states. [2019-12-26 23:52:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 16114 transitions. [2019-12-26 23:52:20,853 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 16114 transitions. Word has length 66 [2019-12-26 23:52:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:20,853 INFO L462 AbstractCegarLoop]: Abstraction has 5743 states and 16114 transitions. [2019-12-26 23:52:20,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 16114 transitions. [2019-12-26 23:52:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:52:20,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:20,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:20,866 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1336907617, now seen corresponding path program 1 times [2019-12-26 23:52:20,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:20,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674778093] [2019-12-26 23:52:20,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:20,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674778093] [2019-12-26 23:52:20,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:20,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:52:20,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709854430] [2019-12-26 23:52:20,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:52:20,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:52:20,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:20,975 INFO L87 Difference]: Start difference. First operand 5743 states and 16114 transitions. Second operand 3 states. [2019-12-26 23:52:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:21,035 INFO L93 Difference]: Finished difference Result 5743 states and 16113 transitions. [2019-12-26 23:52:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:52:21,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:52:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:21,045 INFO L225 Difference]: With dead ends: 5743 [2019-12-26 23:52:21,045 INFO L226 Difference]: Without dead ends: 5743 [2019-12-26 23:52:21,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:52:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5743 states. [2019-12-26 23:52:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5743 to 2989. [2019-12-26 23:52:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-26 23:52:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8461 transitions. [2019-12-26 23:52:21,134 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8461 transitions. Word has length 67 [2019-12-26 23:52:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:21,134 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8461 transitions. [2019-12-26 23:52:21,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:52:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8461 transitions. [2019-12-26 23:52:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:52:21,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:21,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:21,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:21,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:21,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1149441136, now seen corresponding path program 1 times [2019-12-26 23:52:21,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:21,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243469103] [2019-12-26 23:52:21,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:52:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:52:21,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243469103] [2019-12-26 23:52:21,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:52:21,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:52:21,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788901349] [2019-12-26 23:52:21,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:52:21,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:52:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:52:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:52:21,479 INFO L87 Difference]: Start difference. First operand 2989 states and 8461 transitions. Second operand 14 states. [2019-12-26 23:52:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:52:22,246 INFO L93 Difference]: Finished difference Result 5797 states and 16474 transitions. [2019-12-26 23:52:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:52:22,247 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-26 23:52:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:52:22,255 INFO L225 Difference]: With dead ends: 5797 [2019-12-26 23:52:22,255 INFO L226 Difference]: Without dead ends: 5765 [2019-12-26 23:52:22,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2019-12-26 23:52:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2019-12-26 23:52:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 4144. [2019-12-26 23:52:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-26 23:52:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-26 23:52:22,321 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 68 [2019-12-26 23:52:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:52:22,322 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-26 23:52:22,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:52:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-26 23:52:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:52:22,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:52:22,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:52:22,327 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:52:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:52:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 2 times [2019-12-26 23:52:22,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:52:22,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471162935] [2019-12-26 23:52:22,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:52:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:52:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:52:22,458 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:52:22,458 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:52:22,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd3~0_110) (= v_~main$tmp_guard0~0_18 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2189~0.base_27| 4) |v_#length_25|) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27| 1)) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27|) |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0)) |v_#memory_int_21|) (= v_~y$r_buff0_thd1~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27|)) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2189~0.base_27|) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_18|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ULTIMATE.start_main_~#t2189~0.offset=|v_ULTIMATE.start_main_~#t2189~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y~0=v_~y~0_170, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_~#t2189~0.base=|v_ULTIMATE.start_main_~#t2189~0.base_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2191~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2190~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t2189~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2191~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2189~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2190~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:52:22,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_135 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_28) (= (mod v_~y$w_buff1_used~0_63 256) 0) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:52:22,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2190~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11|) |v_ULTIMATE.start_main_~#t2190~0.offset_10| 1))) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11| 1) |v_#valid_37|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2190~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2190~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2190~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2190~0.offset] because there is no mapped edge [2019-12-26 23:52:22,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2191~0.offset_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13|) |v_ULTIMATE.start_main_~#t2191~0.offset_11| 2))) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2191~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2191~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2191~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2191~0.base, #length, ULTIMATE.start_main_~#t2191~0.offset] because there is no mapped edge [2019-12-26 23:52:22,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1011215136 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1011215136 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1011215136| ~y$w_buff0_used~0_In1011215136)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1011215136| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1011215136, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1011215136} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1011215136|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011215136, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1011215136} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:52:22,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-928311897 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-928311897 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-928311897 |P1Thread1of1ForFork1_#t~ite9_Out-928311897|)) (and (= ~y~0_In-928311897 |P1Thread1of1ForFork1_#t~ite9_Out-928311897|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-928311897, ~y$w_buff1~0=~y$w_buff1~0_In-928311897, ~y~0=~y~0_In-928311897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928311897} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-928311897, ~y$w_buff1~0=~y$w_buff1~0_In-928311897, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-928311897|, ~y~0=~y~0_In-928311897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928311897} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-26 23:52:22,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1487586738 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1487586738 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1487586738 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1487586738 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1487586738| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1487586738| ~y$w_buff1_used~0_In-1487586738)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1487586738, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1487586738, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1487586738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1487586738} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1487586738|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1487586738, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1487586738, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1487586738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1487586738} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:52:22,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-295284655 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-295284655 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-295284655) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-295284655 ~y$r_buff0_thd1~0_Out-295284655) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-295284655, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-295284655} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-295284655, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-295284655|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-295284655} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:52:22,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1236109269 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1236109269 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In1236109269 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1236109269 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1236109269| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1236109269| ~y$r_buff1_thd1~0_In1236109269)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1236109269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1236109269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1236109269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1236109269} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1236109269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1236109269, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1236109269|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1236109269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1236109269} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:52:22,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:52:22,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1628468268 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1628468268 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1628468268| ~y~0_In-1628468268)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1628468268 |P2Thread1of1ForFork2_#t~ite15_Out-1628468268|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1628468268, ~y$w_buff1~0=~y$w_buff1~0_In-1628468268, ~y~0=~y~0_In-1628468268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628468268} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1628468268, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1628468268|, ~y$w_buff1~0=~y$w_buff1~0_In-1628468268, ~y~0=~y~0_In-1628468268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628468268} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:52:22,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:52:22,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-26 23:52:22,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1767320886 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1767320886 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1767320886 |P1Thread1of1ForFork1_#t~ite11_Out1767320886|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1767320886|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1767320886, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1767320886} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1767320886, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1767320886, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1767320886|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:52:22,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1362517174 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1362517174 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1362517174 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1362517174 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1362517174 |P1Thread1of1ForFork1_#t~ite12_Out-1362517174|)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1362517174| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1362517174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362517174, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1362517174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1362517174} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1362517174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362517174, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1362517174, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1362517174|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1362517174} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:52:22,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2136844676 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2136844676 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-2136844676|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-2136844676| ~y$r_buff0_thd2~0_In-2136844676) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136844676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2136844676} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2136844676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2136844676, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2136844676|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:52:22,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In2043379882 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2043379882 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2043379882 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In2043379882 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out2043379882|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In2043379882 |P1Thread1of1ForFork1_#t~ite14_Out2043379882|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2043379882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2043379882, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2043379882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2043379882} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2043379882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2043379882, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2043379882, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2043379882|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2043379882} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:52:22,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1084524133 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1084524133 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1084524133|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1084524133 |P2Thread1of1ForFork2_#t~ite17_Out1084524133|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1084524133, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1084524133} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1084524133, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1084524133, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1084524133|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:52:22,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1837251619 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1837251619 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1837251619 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1837251619 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1837251619|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1837251619 |P2Thread1of1ForFork2_#t~ite18_Out-1837251619|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1837251619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837251619, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1837251619, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1837251619} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1837251619, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837251619, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1837251619, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1837251619|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1837251619} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:52:22,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_42|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:52:22,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1335114517 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1335114517 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out1335114517| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1335114517| ~y$r_buff0_thd3~0_In1335114517) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1335114517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1335114517} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1335114517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1335114517, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1335114517|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:52:22,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1344914148 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1344914148 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1344914148 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1344914148 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1344914148|)) (and (= ~y$r_buff1_thd3~0_In-1344914148 |P2Thread1of1ForFork2_#t~ite20_Out-1344914148|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1344914148, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344914148, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1344914148, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1344914148} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1344914148, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344914148, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1344914148|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1344914148, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1344914148} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:52:22,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~y$r_buff1_thd3~0_132) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:52:22,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:52:22,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out2023794242| |ULTIMATE.start_main_#t~ite25_Out2023794242|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2023794242 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2023794242 256)))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out2023794242| ~y$w_buff1~0_In2023794242) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite24_Out2023794242| ~y~0_In2023794242) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2023794242, ~y~0=~y~0_In2023794242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2023794242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2023794242} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2023794242, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2023794242|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out2023794242|, ~y~0=~y~0_In2023794242, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2023794242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2023794242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:52:22,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1449209705 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1449209705 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1449209705|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1449209705 |ULTIMATE.start_main_#t~ite26_Out-1449209705|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449209705, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1449209705} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449209705, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1449209705, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1449209705|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:52:22,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In947035512 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In947035512 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In947035512 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In947035512 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out947035512| ~y$w_buff1_used~0_In947035512) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite27_Out947035512| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In947035512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947035512, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In947035512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947035512} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In947035512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In947035512, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out947035512|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In947035512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In947035512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:52:22,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1221286460 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1221286460 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-1221286460|)) (and (= ~y$r_buff0_thd0~0_In-1221286460 |ULTIMATE.start_main_#t~ite28_Out-1221286460|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1221286460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1221286460} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1221286460|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1221286460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1221286460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:52:22,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1463934898 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1463934898 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1463934898 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1463934898 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1463934898|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1463934898 |ULTIMATE.start_main_#t~ite29_Out1463934898|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1463934898, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1463934898, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1463934898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1463934898} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1463934898, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1463934898|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1463934898, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1463934898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1463934898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:52:22,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2109845084 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out2109845084| ~y$w_buff1~0_In2109845084) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2109845084 256) 0))) (or (= (mod ~y$w_buff0_used~0_In2109845084 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In2109845084 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2109845084 256))))) (= |ULTIMATE.start_main_#t~ite38_Out2109845084| |ULTIMATE.start_main_#t~ite39_Out2109845084|)) (and (= |ULTIMATE.start_main_#t~ite38_In2109845084| |ULTIMATE.start_main_#t~ite38_Out2109845084|) (not .cse0) (= ~y$w_buff1~0_In2109845084 |ULTIMATE.start_main_#t~ite39_Out2109845084|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2109845084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2109845084, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2109845084, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In2109845084|, ~weak$$choice2~0=~weak$$choice2~0_In2109845084, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2109845084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2109845084} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2109845084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2109845084, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2109845084|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2109845084, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2109845084|, ~weak$$choice2~0=~weak$$choice2~0_In2109845084, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2109845084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2109845084} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 23:52:22,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2997776 256)))) (or (and (= ~y$w_buff0_used~0_In2997776 |ULTIMATE.start_main_#t~ite42_Out2997776|) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In2997776| |ULTIMATE.start_main_#t~ite41_Out2997776|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2997776 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In2997776 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In2997776 256) 0)) (= (mod ~y$w_buff0_used~0_In2997776 256) 0))) (= ~y$w_buff0_used~0_In2997776 |ULTIMATE.start_main_#t~ite41_Out2997776|) (= |ULTIMATE.start_main_#t~ite41_Out2997776| |ULTIMATE.start_main_#t~ite42_Out2997776|) .cse0))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In2997776|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2997776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2997776, ~weak$$choice2~0=~weak$$choice2~0_In2997776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2997776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2997776} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2997776|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2997776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2997776, ~weak$$choice2~0=~weak$$choice2~0_In2997776, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2997776|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2997776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2997776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:52:22,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:52:22,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:52:22,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:52:22,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:52:22 BasicIcfg [2019-12-26 23:52:22,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:52:22,575 INFO L168 Benchmark]: Toolchain (without parser) took 69514.64 ms. Allocated memory was 139.5 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 100.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 23:52:22,576 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:52:22,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.63 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 153.7 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:22,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.32 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:22,581 INFO L168 Benchmark]: Boogie Preprocessor took 55.88 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:22,582 INFO L168 Benchmark]: RCFGBuilder took 894.06 ms. Allocated memory is still 202.4 MB. Free memory was 148.2 MB in the beginning and 98.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:52:22,583 INFO L168 Benchmark]: TraceAbstraction took 67673.48 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 98.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 23:52:22,588 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.63 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 153.7 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.32 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.88 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 894.06 ms. Allocated memory is still 202.4 MB. Free memory was 148.2 MB in the beginning and 98.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67673.48 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 98.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, y$flush_delayed=7, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 67.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2207 SDtfs, 1856 SDslu, 3720 SDs, 0 SdLazy, 2175 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 23 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 44907 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 120994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...