/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:31:30,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:31:30,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:31:30,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:31:30,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:31:30,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:31:30,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:31:30,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:31:30,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:31:30,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:31:30,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:31:30,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:31:30,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:31:30,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:31:30,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:31:30,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:31:30,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:31:30,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:31:30,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:31:30,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:31:30,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:31:30,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:31:30,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:31:30,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:31:30,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:31:30,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:31:30,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:31:30,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:31:30,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:31:30,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:31:30,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:31:30,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:31:30,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:31:30,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:31:30,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:31:30,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:31:30,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:31:30,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:31:30,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:31:30,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:31:30,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:31:30,906 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:31:30,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:31:30,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:31:30,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:31:30,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:31:30,944 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:31:30,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:31:30,944 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:31:30,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:31:30,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:31:30,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:31:30,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:31:30,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:31:30,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:31:30,946 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:31:30,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:31:30,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:31:30,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:31:30,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:31:30,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:31:30,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:31:30,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:31:30,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:31:30,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:31:30,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:31:30,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:31:30,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:31:30,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:31:30,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:31:30,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:31:31,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:31:31,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:31:31,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:31:31,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:31:31,269 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:31:31,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2019-12-27 02:31:31,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458ca090/274755a04a944987bc6925f8a250f83a/FLAG1c3a0c3a5 [2019-12-27 02:31:31,877 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:31:31,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2019-12-27 02:31:31,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458ca090/274755a04a944987bc6925f8a250f83a/FLAG1c3a0c3a5 [2019-12-27 02:31:32,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458ca090/274755a04a944987bc6925f8a250f83a [2019-12-27 02:31:32,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:31:32,203 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:31:32,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:31:32,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:31:32,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:31:32,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:32,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680caf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32, skipping insertion in model container [2019-12-27 02:31:32,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:32,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:31:32,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:31:32,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:31:32,793 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:31:32,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:31:32,944 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:31:32,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32 WrapperNode [2019-12-27 02:31:32,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:31:32,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:31:32,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:31:32,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:31:32,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:32,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:31:33,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:31:33,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:31:33,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:31:33,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (1/1) ... [2019-12-27 02:31:33,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:31:33,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:31:33,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:31:33,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:31:33,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (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-27 02:31:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:31:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:31:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:31:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:31:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:31:33,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:31:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:31:33,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:31:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:31:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:31:33,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:31:33,127 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:31:33,864 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:31:33,864 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:31:33,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:31:33 BoogieIcfgContainer [2019-12-27 02:31:33,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:31:33,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:31:33,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:31:33,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:31:33,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:31:32" (1/3) ... [2019-12-27 02:31:33,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1479bc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:31:33, skipping insertion in model container [2019-12-27 02:31:33,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:31:32" (2/3) ... [2019-12-27 02:31:33,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1479bc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:31:33, skipping insertion in model container [2019-12-27 02:31:33,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:31:33" (3/3) ... [2019-12-27 02:31:33,874 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt.i [2019-12-27 02:31:33,885 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:31:33,886 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:31:33,894 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:31:33,895 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:31:33,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,930 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,958 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:31:33,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:31:33,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:31:33,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:31:33,997 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:31:33,997 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:31:33,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:31:33,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:31:33,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:31:33,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:31:34,015 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 02:31:34,017 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 02:31:34,123 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 02:31:34,123 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:31:34,144 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:31:34,160 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 02:31:34,255 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 02:31:34,255 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:31:34,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:31:34,278 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 02:31:34,284 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:31:38,857 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 02:31:38,986 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 02:31:39,023 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45620 [2019-12-27 02:31:39,023 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 02:31:39,027 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-27 02:31:39,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8218 states. [2019-12-27 02:31:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states. [2019-12-27 02:31:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 02:31:39,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:39,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 02:31:39,473 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:39,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 699456563, now seen corresponding path program 1 times [2019-12-27 02:31:39,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:39,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379215694] [2019-12-27 02:31:39,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:39,708 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-27 02:31:39,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379215694] [2019-12-27 02:31:39,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:39,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:31:39,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193912151] [2019-12-27 02:31:39,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:39,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:39,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:39,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:39,734 INFO L87 Difference]: Start difference. First operand 8218 states. Second operand 3 states. [2019-12-27 02:31:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:40,025 INFO L93 Difference]: Finished difference Result 8170 states and 26597 transitions. [2019-12-27 02:31:40,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:40,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 02:31:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:40,111 INFO L225 Difference]: With dead ends: 8170 [2019-12-27 02:31:40,112 INFO L226 Difference]: Without dead ends: 8001 [2019-12-27 02:31:40,113 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-27 02:31:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-12-27 02:31:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2019-12-27 02:31:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-12-27 02:31:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 26077 transitions. [2019-12-27 02:31:40,514 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 26077 transitions. Word has length 5 [2019-12-27 02:31:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:40,514 INFO L462 AbstractCegarLoop]: Abstraction has 8001 states and 26077 transitions. [2019-12-27 02:31:40,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 26077 transitions. [2019-12-27 02:31:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:31:40,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:40,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:40,518 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:40,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash 336736415, now seen corresponding path program 1 times [2019-12-27 02:31:40,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:40,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544988505] [2019-12-27 02:31:40,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:40,741 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-27 02:31:40,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544988505] [2019-12-27 02:31:40,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:40,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:40,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337119610] [2019-12-27 02:31:40,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:31:40,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:31:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:31:40,745 INFO L87 Difference]: Start difference. First operand 8001 states and 26077 transitions. Second operand 4 states. [2019-12-27 02:31:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:41,127 INFO L93 Difference]: Finished difference Result 12769 states and 39815 transitions. [2019-12-27 02:31:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:31:41,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:31:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:41,206 INFO L225 Difference]: With dead ends: 12769 [2019-12-27 02:31:41,206 INFO L226 Difference]: Without dead ends: 12762 [2019-12-27 02:31:41,207 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-27 02:31:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-27 02:31:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11253. [2019-12-27 02:31:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11253 states. [2019-12-27 02:31:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 35607 transitions. [2019-12-27 02:31:42,259 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 35607 transitions. Word has length 11 [2019-12-27 02:31:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:42,260 INFO L462 AbstractCegarLoop]: Abstraction has 11253 states and 35607 transitions. [2019-12-27 02:31:42,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:31:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 35607 transitions. [2019-12-27 02:31:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:31:42,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:42,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:31:42,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1460182026, now seen corresponding path program 1 times [2019-12-27 02:31:42,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:42,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189500172] [2019-12-27 02:31:42,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:42,348 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-27 02:31:42,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189500172] [2019-12-27 02:31:42,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:42,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:42,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015638423] [2019-12-27 02:31:42,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:31:42,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:42,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:31:42,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:31:42,352 INFO L87 Difference]: Start difference. First operand 11253 states and 35607 transitions. Second operand 4 states. [2019-12-27 02:31:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:42,397 INFO L93 Difference]: Finished difference Result 1887 states and 4356 transitions. [2019-12-27 02:31:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:31:42,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:31:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:42,402 INFO L225 Difference]: With dead ends: 1887 [2019-12-27 02:31:42,402 INFO L226 Difference]: Without dead ends: 1601 [2019-12-27 02:31:42,403 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-27 02:31:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-12-27 02:31:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2019-12-27 02:31:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-12-27 02:31:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 3565 transitions. [2019-12-27 02:31:42,444 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 3565 transitions. Word has length 11 [2019-12-27 02:31:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:42,444 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 3565 transitions. [2019-12-27 02:31:42,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:31:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 3565 transitions. [2019-12-27 02:31:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:31:42,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:42,450 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] [2019-12-27 02:31:42,451 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:42,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1717219497, now seen corresponding path program 1 times [2019-12-27 02:31:42,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:42,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608574224] [2019-12-27 02:31:42,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:42,646 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-27 02:31:42,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608574224] [2019-12-27 02:31:42,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:42,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:42,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195664385] [2019-12-27 02:31:42,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:31:42,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:31:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:42,649 INFO L87 Difference]: Start difference. First operand 1601 states and 3565 transitions. Second operand 5 states. [2019-12-27 02:31:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:42,970 INFO L93 Difference]: Finished difference Result 2053 states and 4473 transitions. [2019-12-27 02:31:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:31:42,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 02:31:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:42,975 INFO L225 Difference]: With dead ends: 2053 [2019-12-27 02:31:42,975 INFO L226 Difference]: Without dead ends: 2053 [2019-12-27 02:31:42,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-27 02:31:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-27 02:31:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1824. [2019-12-27 02:31:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-12-27 02:31:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4021 transitions. [2019-12-27 02:31:43,016 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4021 transitions. Word has length 23 [2019-12-27 02:31:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:43,016 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4021 transitions. [2019-12-27 02:31:43,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:31:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4021 transitions. [2019-12-27 02:31:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 02:31:43,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:43,020 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-27 02:31:43,020 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:43,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash 736634855, now seen corresponding path program 1 times [2019-12-27 02:31:43,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:43,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820593399] [2019-12-27 02:31:43,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:43,177 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-27 02:31:43,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820593399] [2019-12-27 02:31:43,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:43,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:31:43,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757613862] [2019-12-27 02:31:43,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:31:43,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:43,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:31:43,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:43,179 INFO L87 Difference]: Start difference. First operand 1824 states and 4021 transitions. Second operand 5 states. [2019-12-27 02:31:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:43,227 INFO L93 Difference]: Finished difference Result 419 states and 767 transitions. [2019-12-27 02:31:43,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:31:43,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 02:31:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:43,229 INFO L225 Difference]: With dead ends: 419 [2019-12-27 02:31:43,229 INFO L226 Difference]: Without dead ends: 373 [2019-12-27 02:31:43,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:31:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-27 02:31:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 338. [2019-12-27 02:31:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-12-27 02:31:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 612 transitions. [2019-12-27 02:31:43,237 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 612 transitions. Word has length 37 [2019-12-27 02:31:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:43,237 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 612 transitions. [2019-12-27 02:31:43,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:31:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 612 transitions. [2019-12-27 02:31:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:31:43,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:43,239 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] [2019-12-27 02:31:43,240 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:43,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1915125863, now seen corresponding path program 1 times [2019-12-27 02:31:43,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:43,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128263554] [2019-12-27 02:31:43,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:43,324 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-27 02:31:43,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128263554] [2019-12-27 02:31:43,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:43,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:31:43,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208706214] [2019-12-27 02:31:43,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:43,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:43,326 INFO L87 Difference]: Start difference. First operand 338 states and 612 transitions. Second operand 3 states. [2019-12-27 02:31:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:43,375 INFO L93 Difference]: Finished difference Result 352 states and 630 transitions. [2019-12-27 02:31:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:43,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 02:31:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:43,377 INFO L225 Difference]: With dead ends: 352 [2019-12-27 02:31:43,377 INFO L226 Difference]: Without dead ends: 352 [2019-12-27 02:31:43,378 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-27 02:31:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-27 02:31:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-12-27 02:31:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-27 02:31:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-12-27 02:31:43,385 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 52 [2019-12-27 02:31:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:43,386 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-12-27 02:31:43,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-12-27 02:31:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:31:43,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:43,387 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] [2019-12-27 02:31:43,387 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1804822393, now seen corresponding path program 1 times [2019-12-27 02:31:43,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:43,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569477168] [2019-12-27 02:31:43,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:43,493 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-27 02:31:43,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569477168] [2019-12-27 02:31:43,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:43,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:43,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047114686] [2019-12-27 02:31:43,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:43,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:43,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:43,495 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-12-27 02:31:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:43,510 INFO L93 Difference]: Finished difference Result 348 states and 613 transitions. [2019-12-27 02:31:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:43,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 02:31:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:43,512 INFO L225 Difference]: With dead ends: 348 [2019-12-27 02:31:43,512 INFO L226 Difference]: Without dead ends: 348 [2019-12-27 02:31:43,512 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-27 02:31:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-27 02:31:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-12-27 02:31:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-27 02:31:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 613 transitions. [2019-12-27 02:31:43,524 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 613 transitions. Word has length 52 [2019-12-27 02:31:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:43,525 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 613 transitions. [2019-12-27 02:31:43,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 613 transitions. [2019-12-27 02:31:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:31:43,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:43,527 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] [2019-12-27 02:31:43,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1986059885, now seen corresponding path program 1 times [2019-12-27 02:31:43,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:43,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689929461] [2019-12-27 02:31:43,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:43,641 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-27 02:31:43,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689929461] [2019-12-27 02:31:43,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:43,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:31:43,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492475971] [2019-12-27 02:31:43,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:31:43,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:31:43,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:31:43,643 INFO L87 Difference]: Start difference. First operand 348 states and 613 transitions. Second operand 5 states. [2019-12-27 02:31:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:43,852 INFO L93 Difference]: Finished difference Result 479 states and 847 transitions. [2019-12-27 02:31:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:31:43,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 02:31:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:43,854 INFO L225 Difference]: With dead ends: 479 [2019-12-27 02:31:43,854 INFO L226 Difference]: Without dead ends: 479 [2019-12-27 02:31:43,855 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-27 02:31:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-27 02:31:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 426. [2019-12-27 02:31:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-27 02:31:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 753 transitions. [2019-12-27 02:31:43,863 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 753 transitions. Word has length 53 [2019-12-27 02:31:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:43,863 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 753 transitions. [2019-12-27 02:31:43,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:31:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 753 transitions. [2019-12-27 02:31:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:31:43,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:43,865 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] [2019-12-27 02:31:43,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2130042739, now seen corresponding path program 2 times [2019-12-27 02:31:43,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:43,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162090856] [2019-12-27 02:31:43,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:44,069 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-27 02:31:44,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162090856] [2019-12-27 02:31:44,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:44,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:31:44,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977269197] [2019-12-27 02:31:44,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:31:44,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:31:44,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:31:44,072 INFO L87 Difference]: Start difference. First operand 426 states and 753 transitions. Second operand 9 states. [2019-12-27 02:31:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:44,419 INFO L93 Difference]: Finished difference Result 555 states and 972 transitions. [2019-12-27 02:31:44,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:31:44,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 02:31:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:44,423 INFO L225 Difference]: With dead ends: 555 [2019-12-27 02:31:44,423 INFO L226 Difference]: Without dead ends: 555 [2019-12-27 02:31:44,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:31:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-27 02:31:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 440. [2019-12-27 02:31:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-12-27 02:31:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 779 transitions. [2019-12-27 02:31:44,433 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 779 transitions. Word has length 53 [2019-12-27 02:31:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:44,434 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 779 transitions. [2019-12-27 02:31:44,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:31:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 779 transitions. [2019-12-27 02:31:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:31:44,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:44,435 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] [2019-12-27 02:31:44,435 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1191623101, now seen corresponding path program 3 times [2019-12-27 02:31:44,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:44,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191589791] [2019-12-27 02:31:44,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:44,596 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-27 02:31:44,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191589791] [2019-12-27 02:31:44,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:44,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:31:44,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534644512] [2019-12-27 02:31:44,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:31:44,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:44,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:31:44,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:31:44,598 INFO L87 Difference]: Start difference. First operand 440 states and 779 transitions. Second operand 8 states. [2019-12-27 02:31:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:45,002 INFO L93 Difference]: Finished difference Result 667 states and 1168 transitions. [2019-12-27 02:31:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:31:45,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 02:31:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:45,005 INFO L225 Difference]: With dead ends: 667 [2019-12-27 02:31:45,006 INFO L226 Difference]: Without dead ends: 667 [2019-12-27 02:31:45,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:31:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-12-27 02:31:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 436. [2019-12-27 02:31:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 02:31:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 768 transitions. [2019-12-27 02:31:45,017 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 768 transitions. Word has length 53 [2019-12-27 02:31:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:45,017 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 768 transitions. [2019-12-27 02:31:45,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:31:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 768 transitions. [2019-12-27 02:31:45,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:31:45,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:45,019 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] [2019-12-27 02:31:45,019 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:45,019 INFO L82 PathProgramCache]: Analyzing trace with hash -424695835, now seen corresponding path program 4 times [2019-12-27 02:31:45,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:45,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030762479] [2019-12-27 02:31:45,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:45,096 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-27 02:31:45,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030762479] [2019-12-27 02:31:45,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:45,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:31:45,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209721257] [2019-12-27 02:31:45,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:31:45,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:45,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:31:45,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:31:45,099 INFO L87 Difference]: Start difference. First operand 436 states and 768 transitions. Second operand 3 states. [2019-12-27 02:31:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:45,135 INFO L93 Difference]: Finished difference Result 435 states and 766 transitions. [2019-12-27 02:31:45,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:31:45,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 02:31:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:45,137 INFO L225 Difference]: With dead ends: 435 [2019-12-27 02:31:45,137 INFO L226 Difference]: Without dead ends: 435 [2019-12-27 02:31:45,138 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-27 02:31:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-27 02:31:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 347. [2019-12-27 02:31:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-27 02:31:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 602 transitions. [2019-12-27 02:31:45,145 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 602 transitions. Word has length 53 [2019-12-27 02:31:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:45,145 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 602 transitions. [2019-12-27 02:31:45,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:31:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 602 transitions. [2019-12-27 02:31:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 02:31:45,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:45,147 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] [2019-12-27 02:31:45,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash -752439480, now seen corresponding path program 1 times [2019-12-27 02:31:45,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:45,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728560095] [2019-12-27 02:31:45,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:31:45,342 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-27 02:31:45,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728560095] [2019-12-27 02:31:45,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:31:45,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:31:45,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254589716] [2019-12-27 02:31:45,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:31:45,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:31:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:31:45,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:31:45,345 INFO L87 Difference]: Start difference. First operand 347 states and 602 transitions. Second operand 7 states. [2019-12-27 02:31:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:31:45,496 INFO L93 Difference]: Finished difference Result 550 states and 958 transitions. [2019-12-27 02:31:45,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:31:45,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 02:31:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:31:45,498 INFO L225 Difference]: With dead ends: 550 [2019-12-27 02:31:45,498 INFO L226 Difference]: Without dead ends: 220 [2019-12-27 02:31:45,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:31:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-27 02:31:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-27 02:31:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-27 02:31:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 337 transitions. [2019-12-27 02:31:45,504 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 337 transitions. Word has length 54 [2019-12-27 02:31:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:31:45,504 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 337 transitions. [2019-12-27 02:31:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:31:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 337 transitions. [2019-12-27 02:31:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 02:31:45,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:31:45,506 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] [2019-12-27 02:31:45,506 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:31:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:31:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash 516281010, now seen corresponding path program 2 times [2019-12-27 02:31:45,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:31:45,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111492490] [2019-12-27 02:31:45,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:31:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:31:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:31:45,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:31:45,690 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:31:45,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1099~0.base_20| 4)) (= 0 v_~x$r_buff1_thd2~0_157) (= (select .cse0 |v_ULTIMATE.start_main_~#t1099~0.base_20|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1099~0.base_20|) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1099~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1099~0.base_20|) |v_ULTIMATE.start_main_~#t1099~0.offset_15| 0)) |v_#memory_int_17|) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 v_~__unbuffered_cnt~0_64) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1099~0.base_20| 1)) (= 0 v_~x$w_buff0_used~0_638) (= 0 |v_ULTIMATE.start_main_~#t1099~0.offset_15|) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_~#t1100~0.base=|v_ULTIMATE.start_main_~#t1100~0.base_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, #length=|v_#length_17|, ULTIMATE.start_main_~#t1099~0.base=|v_ULTIMATE.start_main_~#t1099~0.base_20|, ULTIMATE.start_main_~#t1099~0.offset=|v_ULTIMATE.start_main_~#t1099~0.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1100~0.offset=|v_ULTIMATE.start_main_~#t1100~0.offset_14|, ~y~0=v_~y~0_115, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1100~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1099~0.base, ULTIMATE.start_main_~#t1099~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1100~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 02:31:45,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1100~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1100~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1100~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1100~0.base_11|) |v_ULTIMATE.start_main_~#t1100~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1100~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1100~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1100~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1100~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1100~0.offset=|v_ULTIMATE.start_main_~#t1100~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1100~0.base=|v_ULTIMATE.start_main_~#t1100~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1100~0.offset, #length, ULTIMATE.start_main_~#t1100~0.base] because there is no mapped edge [2019-12-27 02:31:45,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= 1 v_~x$w_buff0_used~0_78) (= (mod v_~x$w_buff1_used~0_47 256) 0) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 02:31:45,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1206770568| |P0Thread1of1ForFork0_#t~ite4_Out1206770568|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1206770568 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1206770568 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out1206770568| ~x$w_buff1~0_In1206770568) .cse0 (not .cse1) (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out1206770568| ~x~0_In1206770568) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1206770568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1206770568, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1206770568, ~x~0=~x~0_In1206770568} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1206770568|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1206770568|, ~x$w_buff1~0=~x$w_buff1~0_In1206770568, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1206770568, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1206770568, ~x~0=~x~0_In1206770568} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 02:31:45,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In2115282238 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2115282238 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2115282238| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2115282238 |P0Thread1of1ForFork0_#t~ite5_Out2115282238|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2115282238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115282238} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2115282238|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2115282238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115282238} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:31:45,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In213883204 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In213883204 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In213883204 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In213883204 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In213883204 |P0Thread1of1ForFork0_#t~ite6_Out213883204|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out213883204|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In213883204, ~x$w_buff1_used~0=~x$w_buff1_used~0_In213883204, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In213883204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In213883204} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out213883204|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In213883204, ~x$w_buff1_used~0=~x$w_buff1_used~0_In213883204, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In213883204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In213883204} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:31:45,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1409816642 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1409816642 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1409816642| 0)) (and (= ~x$r_buff0_thd1~0_In1409816642 |P0Thread1of1ForFork0_#t~ite7_Out1409816642|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1409816642, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1409816642} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1409816642, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1409816642|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1409816642} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 02:31:45,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In171156590 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In171156590 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In171156590 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In171156590 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out171156590| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out171156590| ~x$r_buff1_thd1~0_In171156590) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In171156590, ~x$w_buff1_used~0=~x$w_buff1_used~0_In171156590, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In171156590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In171156590} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In171156590, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out171156590|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In171156590, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In171156590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In171156590} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:31:45,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 02:31:45,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In5304169 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In5304169 256) 0))) (or (and (= ~x$w_buff0_used~0_In5304169 |P1Thread1of1ForFork1_#t~ite11_Out5304169|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out5304169|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In5304169, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5304169} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out5304169|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In5304169, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5304169} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:31:45,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2110693488 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In2110693488 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2110693488 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2110693488 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out2110693488|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In2110693488 |P1Thread1of1ForFork1_#t~ite12_Out2110693488|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2110693488, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2110693488, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2110693488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2110693488} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2110693488, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2110693488, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2110693488|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2110693488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2110693488} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:31:45,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In2103223218 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2103223218 256)))) (or (and (= ~x$r_buff0_thd2~0_Out2103223218 ~x$r_buff0_thd2~0_In2103223218) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out2103223218 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2103223218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2103223218} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2103223218|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2103223218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2103223218} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 02:31:45,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In190949344 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In190949344 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In190949344 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In190949344 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out190949344|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out190949344| ~x$r_buff1_thd2~0_In190949344) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In190949344, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In190949344, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In190949344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In190949344} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In190949344, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In190949344, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In190949344, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out190949344|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In190949344} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:31:45,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:31:45,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:31:45,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1106095587 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1106095587 256) 0))) (or (and (= ~x~0_In1106095587 |ULTIMATE.start_main_#t~ite17_Out1106095587|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out1106095587| ~x$w_buff1~0_In1106095587) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1106095587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1106095587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1106095587, ~x~0=~x~0_In1106095587} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1106095587|, ~x$w_buff1~0=~x$w_buff1~0_In1106095587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1106095587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1106095587, ~x~0=~x~0_In1106095587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 02:31:45,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 02:31:45,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-711764097 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-711764097 256) 0))) (or (and (= ~x$w_buff0_used~0_In-711764097 |ULTIMATE.start_main_#t~ite19_Out-711764097|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out-711764097|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-711764097, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-711764097} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-711764097, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-711764097|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-711764097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 02:31:45,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In8083673 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In8083673 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In8083673 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In8083673 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out8083673| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out8083673| ~x$w_buff1_used~0_In8083673) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In8083673, ~x$w_buff1_used~0=~x$w_buff1_used~0_In8083673, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In8083673, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8083673} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In8083673, ~x$w_buff1_used~0=~x$w_buff1_used~0_In8083673, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out8083673|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In8083673, ~x$w_buff0_used~0=~x$w_buff0_used~0_In8083673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:31:45,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1568162865 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1568162865 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1568162865|)) (and (= ~x$r_buff0_thd0~0_In-1568162865 |ULTIMATE.start_main_#t~ite21_Out-1568162865|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1568162865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1568162865} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1568162865, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1568162865|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1568162865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:31:45,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1734938943 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1734938943 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1734938943 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1734938943 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1734938943| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1734938943 |ULTIMATE.start_main_#t~ite22_Out1734938943|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1734938943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1734938943, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1734938943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734938943} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1734938943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1734938943, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1734938943, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1734938943|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734938943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:31:45,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1174885564 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In-1174885564| |ULTIMATE.start_main_#t~ite31_Out-1174885564|) (= |ULTIMATE.start_main_#t~ite32_Out-1174885564| ~x$w_buff1~0_In-1174885564)) (and (= |ULTIMATE.start_main_#t~ite31_Out-1174885564| ~x$w_buff1~0_In-1174885564) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1174885564 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd0~0_In-1174885564 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1174885564 256))) (= 0 (mod ~x$w_buff0_used~0_In-1174885564 256)))) (= |ULTIMATE.start_main_#t~ite32_Out-1174885564| |ULTIMATE.start_main_#t~ite31_Out-1174885564|) .cse0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1174885564, ~x$w_buff1~0=~x$w_buff1~0_In-1174885564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1174885564, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1174885564, ~weak$$choice2~0=~weak$$choice2~0_In-1174885564, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1174885564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1174885564} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1174885564, ~x$w_buff1~0=~x$w_buff1~0_In-1174885564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1174885564, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1174885564|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1174885564, ~weak$$choice2~0=~weak$$choice2~0_In-1174885564, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1174885564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1174885564} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 02:31:45,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1192748406 256) 0))) (or (and .cse0 (= ~x$w_buff1_used~0_In-1192748406 |ULTIMATE.start_main_#t~ite37_Out-1192748406|) (= |ULTIMATE.start_main_#t~ite38_Out-1192748406| |ULTIMATE.start_main_#t~ite37_Out-1192748406|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1192748406 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1192748406 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1192748406 256))) (= 0 (mod ~x$w_buff0_used~0_In-1192748406 256))))) (and (= |ULTIMATE.start_main_#t~ite37_In-1192748406| |ULTIMATE.start_main_#t~ite37_Out-1192748406|) (not .cse0) (= ~x$w_buff1_used~0_In-1192748406 |ULTIMATE.start_main_#t~ite38_Out-1192748406|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1192748406, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1192748406, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1192748406|, ~weak$$choice2~0=~weak$$choice2~0_In-1192748406, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1192748406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1192748406} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1192748406, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1192748406, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1192748406|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1192748406|, ~weak$$choice2~0=~weak$$choice2~0_In-1192748406, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1192748406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1192748406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:31:45,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:31:45,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:31:45,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) 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_12, 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-27 02:31:45,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:31:45 BasicIcfg [2019-12-27 02:31:45,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:31:45,825 INFO L168 Benchmark]: Toolchain (without parser) took 13622.87 ms. Allocated memory was 145.8 MB in the beginning and 555.2 MB in the end (delta: 409.5 MB). Free memory was 101.8 MB in the beginning and 389.4 MB in the end (delta: -287.6 MB). Peak memory consumption was 121.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:45,826 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:31:45,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.49 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 156.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:45,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.06 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:45,833 INFO L168 Benchmark]: Boogie Preprocessor took 37.45 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:45,833 INFO L168 Benchmark]: RCFGBuilder took 813.24 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 106.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:45,841 INFO L168 Benchmark]: TraceAbstraction took 11955.66 ms. Allocated memory was 202.4 MB in the beginning and 555.2 MB in the end (delta: 352.8 MB). Free memory was 106.4 MB in the beginning and 389.4 MB in the end (delta: -283.0 MB). Peak memory consumption was 69.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:31:45,846 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.47 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.49 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 156.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.06 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.45 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.24 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 106.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11955.66 ms. Allocated memory was 202.4 MB in the beginning and 555.2 MB in the end (delta: 352.8 MB). Free memory was 106.4 MB in the beginning and 389.4 MB in the end (delta: -283.0 MB). Peak memory consumption was 69.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 88 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 3874 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 57 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 45620 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 1082 SDslu, 2053 SDs, 0 SdLazy, 1226 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11253occurred 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: 1.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 2288 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 68939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...