/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:34:46,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:34:46,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:34:46,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:34:46,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:34:46,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:34:46,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:34:46,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:34:46,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:34:46,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:34:46,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:34:46,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:34:46,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:34:46,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:34:46,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:34:46,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:34:46,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:34:46,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:34:46,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:34:46,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:34:46,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:34:46,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:34:46,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:34:46,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:34:46,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:34:46,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:34:46,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:34:47,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:34:47,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:34:47,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:34:47,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:34:47,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:34:47,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:34:47,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:34:47,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:34:47,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:34:47,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:34:47,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:34:47,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:34:47,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:34:47,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:34:47,012 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-VariableLbe-MCR.epf [2019-12-27 22:34:47,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:34:47,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:34:47,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:34:47,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:34:47,050 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:34:47,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:34:47,050 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:34:47,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:34:47,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:34:47,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:34:47,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:34:47,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:34:47,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:34:47,051 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:34:47,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:34:47,052 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:34:47,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:34:47,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:34:47,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:34:47,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:34:47,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:34:47,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:34:47,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:34:47,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:34:47,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:34:47,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:34:47,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:34:47,055 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:34:47,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:34:47,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:34:47,056 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:34:47,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:34:47,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:34:47,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:34:47,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:34:47,379 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:34:47,380 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:34:47,381 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2019-12-27 22:34:47,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83831c26b/a9b4fc5da0fb40fe8d59c438660d7029/FLAG9b4c2fc8f [2019-12-27 22:34:47,992 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:34:47,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2019-12-27 22:34:48,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83831c26b/a9b4fc5da0fb40fe8d59c438660d7029/FLAG9b4c2fc8f [2019-12-27 22:34:48,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83831c26b/a9b4fc5da0fb40fe8d59c438660d7029 [2019-12-27 22:34:48,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:34:48,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:34:48,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:34:48,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:34:48,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:34:48,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:34:48" (1/1) ... [2019-12-27 22:34:48,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e265609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:48, skipping insertion in model container [2019-12-27 22:34:48,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:34:48" (1/1) ... [2019-12-27 22:34:48,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:34:48,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:34:48,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:34:48,955 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:34:49,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:34:49,120 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:34:49,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49 WrapperNode [2019-12-27 22:34:49,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:34:49,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:34:49,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:34:49,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:34:49,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:34:49,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:34:49,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:34:49,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:34:49,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (1/1) ... [2019-12-27 22:34:49,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:34:49,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:34:49,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:34:49,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:34:49,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (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 22:34:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 22:34:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:34:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:34:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:34:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:34:49,290 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:34:49,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:34:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:34:49,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:34:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:34:49,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:34:49,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 22:34:49,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:34:49,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:34:49,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:34:49,295 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 22:34:50,022 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:34:50,022 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 22:34:50,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:34:50 BoogieIcfgContainer [2019-12-27 22:34:50,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:34:50,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:34:50,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:34:50,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:34:50,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:34:48" (1/3) ... [2019-12-27 22:34:50,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430bac0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:34:50, skipping insertion in model container [2019-12-27 22:34:50,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:34:49" (2/3) ... [2019-12-27 22:34:50,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430bac0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:34:50, skipping insertion in model container [2019-12-27 22:34:50,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:34:50" (3/3) ... [2019-12-27 22:34:50,033 INFO L109 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2019-12-27 22:34:50,044 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:34:50,045 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:34:50,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 22:34:50,057 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:34:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,195 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,209 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,209 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:34:50,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 22:34:50,243 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:34:50,244 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:34:50,244 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:34:50,244 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:34:50,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:34:50,244 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:34:50,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:34:50,245 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:34:50,261 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 195 transitions [2019-12-27 22:34:50,263 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 195 transitions [2019-12-27 22:34:50,368 INFO L132 PetriNetUnfolder]: 36/192 cut-off events. [2019-12-27 22:34:50,369 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:34:50,385 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 36/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2019-12-27 22:34:50,406 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 195 transitions [2019-12-27 22:34:50,457 INFO L132 PetriNetUnfolder]: 36/192 cut-off events. [2019-12-27 22:34:50,457 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:34:50,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 36/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2019-12-27 22:34:50,478 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11934 [2019-12-27 22:34:50,480 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:34:54,145 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-27 22:34:54,321 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-27 22:34:54,881 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2019-12-27 22:34:55,172 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-27 22:34:55,193 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48599 [2019-12-27 22:34:55,193 INFO L214 etLargeBlockEncoding]: Total number of compositions: 130 [2019-12-27 22:34:55,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 81 transitions [2019-12-27 22:34:55,972 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12266 states. [2019-12-27 22:34:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states. [2019-12-27 22:34:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:34:56,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:56,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:56,015 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash -111406329, now seen corresponding path program 1 times [2019-12-27 22:34:56,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:56,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969972586] [2019-12-27 22:34:56,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:56,366 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 22:34:56,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969972586] [2019-12-27 22:34:56,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:56,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:56,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252867724] [2019-12-27 22:34:56,370 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:56,378 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:56,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 22:34:56,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:56,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:56,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:56,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:56,429 INFO L87 Difference]: Start difference. First operand 12266 states. Second operand 3 states. [2019-12-27 22:34:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:56,733 INFO L93 Difference]: Finished difference Result 11696 states and 45912 transitions. [2019-12-27 22:34:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:56,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:34:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:56,863 INFO L225 Difference]: With dead ends: 11696 [2019-12-27 22:34:56,864 INFO L226 Difference]: Without dead ends: 11024 [2019-12-27 22:34:56,865 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 22:34:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11024 states. [2019-12-27 22:34:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11024 to 11024. [2019-12-27 22:34:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11024 states. [2019-12-27 22:34:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11024 states to 11024 states and 43272 transitions. [2019-12-27 22:34:57,672 INFO L78 Accepts]: Start accepts. Automaton has 11024 states and 43272 transitions. Word has length 18 [2019-12-27 22:34:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:57,673 INFO L462 AbstractCegarLoop]: Abstraction has 11024 states and 43272 transitions. [2019-12-27 22:34:57,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11024 states and 43272 transitions. [2019-12-27 22:34:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:34:57,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:57,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:57,683 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2135257785, now seen corresponding path program 1 times [2019-12-27 22:34:57,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:57,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692515453] [2019-12-27 22:34:57,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:57,859 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 22:34:57,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692515453] [2019-12-27 22:34:57,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:57,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:57,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [471047825] [2019-12-27 22:34:57,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:57,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:57,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 22:34:57,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:57,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:57,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:57,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:57,874 INFO L87 Difference]: Start difference. First operand 11024 states and 43272 transitions. Second operand 4 states. [2019-12-27 22:34:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:58,061 INFO L93 Difference]: Finished difference Result 7300 states and 25020 transitions. [2019-12-27 22:34:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:34:58,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 22:34:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:58,116 INFO L225 Difference]: With dead ends: 7300 [2019-12-27 22:34:58,116 INFO L226 Difference]: Without dead ends: 6688 [2019-12-27 22:34:58,118 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 22:34:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2019-12-27 22:34:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 6688. [2019-12-27 22:34:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6688 states. [2019-12-27 22:34:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 23024 transitions. [2019-12-27 22:34:58,356 INFO L78 Accepts]: Start accepts. Automaton has 6688 states and 23024 transitions. Word has length 19 [2019-12-27 22:34:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:58,357 INFO L462 AbstractCegarLoop]: Abstraction has 6688 states and 23024 transitions. [2019-12-27 22:34:58,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 6688 states and 23024 transitions. [2019-12-27 22:34:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 22:34:58,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:58,363 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] [2019-12-27 22:34:58,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash 672227109, now seen corresponding path program 1 times [2019-12-27 22:34:58,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:58,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097737211] [2019-12-27 22:34:58,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:58,507 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 22:34:58,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097737211] [2019-12-27 22:34:58,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:58,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:34:58,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1787102917] [2019-12-27 22:34:58,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:58,514 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:58,604 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 24 transitions. [2019-12-27 22:34:58,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:58,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:34:58,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:58,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:58,650 INFO L87 Difference]: Start difference. First operand 6688 states and 23024 transitions. Second operand 6 states. [2019-12-27 22:34:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:58,740 INFO L93 Difference]: Finished difference Result 1940 states and 5442 transitions. [2019-12-27 22:34:58,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:58,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-27 22:34:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:58,746 INFO L225 Difference]: With dead ends: 1940 [2019-12-27 22:34:58,746 INFO L226 Difference]: Without dead ends: 1584 [2019-12-27 22:34:58,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:34:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-12-27 22:34:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2019-12-27 22:34:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2019-12-27 22:34:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 4296 transitions. [2019-12-27 22:34:58,799 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 4296 transitions. Word has length 20 [2019-12-27 22:34:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:58,800 INFO L462 AbstractCegarLoop]: Abstraction has 1584 states and 4296 transitions. [2019-12-27 22:34:58,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 4296 transitions. [2019-12-27 22:34:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:34:58,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:58,805 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] [2019-12-27 22:34:58,805 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1232156220, now seen corresponding path program 1 times [2019-12-27 22:34:58,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:58,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752076717] [2019-12-27 22:34:58,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:58,938 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 22:34:58,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752076717] [2019-12-27 22:34:58,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:58,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:58,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069568857] [2019-12-27 22:34:58,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:58,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:58,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 34 transitions. [2019-12-27 22:34:58,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:58,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:58,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:58,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:58,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:58,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:58,956 INFO L87 Difference]: Start difference. First operand 1584 states and 4296 transitions. Second operand 4 states. [2019-12-27 22:34:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:59,124 INFO L93 Difference]: Finished difference Result 1955 states and 5151 transitions. [2019-12-27 22:34:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:59,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-27 22:34:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:59,130 INFO L225 Difference]: With dead ends: 1955 [2019-12-27 22:34:59,131 INFO L226 Difference]: Without dead ends: 1955 [2019-12-27 22:34:59,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 22:34:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2019-12-27 22:34:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1721. [2019-12-27 22:34:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2019-12-27 22:34:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 4600 transitions. [2019-12-27 22:34:59,179 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 4600 transitions. Word has length 30 [2019-12-27 22:34:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:59,179 INFO L462 AbstractCegarLoop]: Abstraction has 1721 states and 4600 transitions. [2019-12-27 22:34:59,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 4600 transitions. [2019-12-27 22:34:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:34:59,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:59,184 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] [2019-12-27 22:34:59,184 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash -710563723, now seen corresponding path program 1 times [2019-12-27 22:34:59,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:59,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135467436] [2019-12-27 22:34:59,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:59,222 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 22:34:59,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135467436] [2019-12-27 22:34:59,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:59,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:59,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915997296] [2019-12-27 22:34:59,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:59,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:59,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 67 transitions. [2019-12-27 22:34:59,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:59,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:34:59,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:34:59,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:34:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:59,277 INFO L87 Difference]: Start difference. First operand 1721 states and 4600 transitions. Second operand 5 states. [2019-12-27 22:34:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:59,367 INFO L93 Difference]: Finished difference Result 2648 states and 6929 transitions. [2019-12-27 22:34:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:59,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 22:34:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:59,374 INFO L225 Difference]: With dead ends: 2648 [2019-12-27 22:34:59,375 INFO L226 Difference]: Without dead ends: 2648 [2019-12-27 22:34:59,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2019-12-27 22:34:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1990. [2019-12-27 22:34:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2019-12-27 22:34:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 5230 transitions. [2019-12-27 22:34:59,429 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 5230 transitions. Word has length 31 [2019-12-27 22:34:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:59,429 INFO L462 AbstractCegarLoop]: Abstraction has 1990 states and 5230 transitions. [2019-12-27 22:34:59,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:34:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 5230 transitions. [2019-12-27 22:34:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:34:59,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:59,434 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] [2019-12-27 22:34:59,434 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:59,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:59,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1888465417, now seen corresponding path program 1 times [2019-12-27 22:34:59,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:59,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684539583] [2019-12-27 22:34:59,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:59,506 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 22:34:59,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684539583] [2019-12-27 22:34:59,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:59,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:59,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [49091637] [2019-12-27 22:34:59,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:59,516 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:59,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 156 transitions. [2019-12-27 22:34:59,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:59,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:34:59,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:59,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:59,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:59,578 INFO L87 Difference]: Start difference. First operand 1990 states and 5230 transitions. Second operand 6 states. [2019-12-27 22:34:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:59,845 INFO L93 Difference]: Finished difference Result 2495 states and 6433 transitions. [2019-12-27 22:34:59,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:59,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 22:34:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:59,854 INFO L225 Difference]: With dead ends: 2495 [2019-12-27 22:34:59,855 INFO L226 Difference]: Without dead ends: 2495 [2019-12-27 22:34:59,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:34:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2019-12-27 22:34:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2173. [2019-12-27 22:34:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2173 states. [2019-12-27 22:34:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 5691 transitions. [2019-12-27 22:34:59,921 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 5691 transitions. Word has length 31 [2019-12-27 22:34:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:59,922 INFO L462 AbstractCegarLoop]: Abstraction has 2173 states and 5691 transitions. [2019-12-27 22:34:59,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 5691 transitions. [2019-12-27 22:34:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:34:59,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:59,927 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] [2019-12-27 22:34:59,927 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1776201258, now seen corresponding path program 1 times [2019-12-27 22:34:59,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:59,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822948064] [2019-12-27 22:34:59,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:00,025 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 22:35:00,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822948064] [2019-12-27 22:35:00,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:00,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:35:00,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656765365] [2019-12-27 22:35:00,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:00,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:00,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 35 transitions. [2019-12-27 22:35:00,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:00,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:35:00,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:35:00,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:00,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:35:00,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:35:00,067 INFO L87 Difference]: Start difference. First operand 2173 states and 5691 transitions. Second operand 7 states. [2019-12-27 22:35:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:00,153 INFO L93 Difference]: Finished difference Result 1349 states and 3506 transitions. [2019-12-27 22:35:00,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:35:00,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-12-27 22:35:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:00,157 INFO L225 Difference]: With dead ends: 1349 [2019-12-27 22:35:00,157 INFO L226 Difference]: Without dead ends: 1252 [2019-12-27 22:35:00,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:35:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-27 22:35:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1182. [2019-12-27 22:35:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-12-27 22:35:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 3103 transitions. [2019-12-27 22:35:00,184 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 3103 transitions. Word has length 31 [2019-12-27 22:35:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:00,186 INFO L462 AbstractCegarLoop]: Abstraction has 1182 states and 3103 transitions. [2019-12-27 22:35:00,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:35:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 3103 transitions. [2019-12-27 22:35:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:35:00,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:00,190 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] [2019-12-27 22:35:00,190 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash -102448010, now seen corresponding path program 1 times [2019-12-27 22:35:00,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:00,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239951674] [2019-12-27 22:35:00,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:00,313 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 22:35:00,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239951674] [2019-12-27 22:35:00,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:00,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:35:00,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488264454] [2019-12-27 22:35:00,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:00,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:00,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 167 transitions. [2019-12-27 22:35:00,377 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:00,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:35:00,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:35:00,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:00,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:35:00,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:35:00,414 INFO L87 Difference]: Start difference. First operand 1182 states and 3103 transitions. Second operand 7 states. [2019-12-27 22:35:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:00,659 INFO L93 Difference]: Finished difference Result 1346 states and 3491 transitions. [2019-12-27 22:35:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:35:00,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 22:35:00,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:00,668 INFO L225 Difference]: With dead ends: 1346 [2019-12-27 22:35:00,668 INFO L226 Difference]: Without dead ends: 1346 [2019-12-27 22:35:00,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:35:00,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-12-27 22:35:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1198. [2019-12-27 22:35:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-12-27 22:35:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 3147 transitions. [2019-12-27 22:35:00,698 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 3147 transitions. Word has length 42 [2019-12-27 22:35:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:00,698 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 3147 transitions. [2019-12-27 22:35:00,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:35:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 3147 transitions. [2019-12-27 22:35:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:35:00,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:00,703 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] [2019-12-27 22:35:00,704 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:00,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash -304716010, now seen corresponding path program 1 times [2019-12-27 22:35:00,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:00,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486404687] [2019-12-27 22:35:00,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:00,771 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 22:35:00,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486404687] [2019-12-27 22:35:00,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:00,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:35:00,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883948420] [2019-12-27 22:35:00,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:00,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:00,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 87 transitions. [2019-12-27 22:35:00,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:00,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:35:00,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:35:00,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:00,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:35:00,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:35:00,921 INFO L87 Difference]: Start difference. First operand 1198 states and 3147 transitions. Second operand 4 states. [2019-12-27 22:35:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:00,974 INFO L93 Difference]: Finished difference Result 1194 states and 2956 transitions. [2019-12-27 22:35:00,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:35:00,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-27 22:35:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:00,978 INFO L225 Difference]: With dead ends: 1194 [2019-12-27 22:35:00,979 INFO L226 Difference]: Without dead ends: 1194 [2019-12-27 22:35:00,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:35:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-12-27 22:35:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1108. [2019-12-27 22:35:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2019-12-27 22:35:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 2777 transitions. [2019-12-27 22:35:01,004 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 2777 transitions. Word has length 43 [2019-12-27 22:35:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:01,005 INFO L462 AbstractCegarLoop]: Abstraction has 1108 states and 2777 transitions. [2019-12-27 22:35:01,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:35:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 2777 transitions. [2019-12-27 22:35:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:35:01,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:01,008 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] [2019-12-27 22:35:01,008 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1857549896, now seen corresponding path program 1 times [2019-12-27 22:35:01,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:01,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696745852] [2019-12-27 22:35:01,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:01,082 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 22:35:01,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696745852] [2019-12-27 22:35:01,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:01,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:35:01,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381687473] [2019-12-27 22:35:01,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:01,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:01,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 168 transitions. [2019-12-27 22:35:01,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:01,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:35:01,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:35:01,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:01,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:35:01,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:35:01,168 INFO L87 Difference]: Start difference. First operand 1108 states and 2777 transitions. Second operand 3 states. [2019-12-27 22:35:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:01,181 INFO L93 Difference]: Finished difference Result 1106 states and 2772 transitions. [2019-12-27 22:35:01,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:35:01,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-27 22:35:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:01,186 INFO L225 Difference]: With dead ends: 1106 [2019-12-27 22:35:01,187 INFO L226 Difference]: Without dead ends: 1106 [2019-12-27 22:35:01,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:35:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-12-27 22:35:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2019-12-27 22:35:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-12-27 22:35:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2772 transitions. [2019-12-27 22:35:01,210 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2772 transitions. Word has length 43 [2019-12-27 22:35:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:01,211 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 2772 transitions. [2019-12-27 22:35:01,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:35:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2772 transitions. [2019-12-27 22:35:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 22:35:01,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:01,214 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] [2019-12-27 22:35:01,215 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1749521280, now seen corresponding path program 1 times [2019-12-27 22:35:01,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:01,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251524646] [2019-12-27 22:35:01,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:02,612 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 22:35:02,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251524646] [2019-12-27 22:35:02,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:02,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 22:35:02,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290848732] [2019-12-27 22:35:02,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:02,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:02,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 169 transitions. [2019-12-27 22:35:02,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:03,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:35:04,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:35:04,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:35:04,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 22:35:04,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 22:35:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:35:04,326 INFO L87 Difference]: Start difference. First operand 1106 states and 2772 transitions. Second operand 33 states. [2019-12-27 22:35:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:08,690 INFO L93 Difference]: Finished difference Result 1574 states and 3817 transitions. [2019-12-27 22:35:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 22:35:08,691 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-12-27 22:35:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:08,695 INFO L225 Difference]: With dead ends: 1574 [2019-12-27 22:35:08,695 INFO L226 Difference]: Without dead ends: 1466 [2019-12-27 22:35:08,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=299, Invalid=1593, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 22:35:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-12-27 22:35:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1168. [2019-12-27 22:35:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2019-12-27 22:35:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2913 transitions. [2019-12-27 22:35:08,722 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2913 transitions. Word has length 44 [2019-12-27 22:35:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:08,723 INFO L462 AbstractCegarLoop]: Abstraction has 1168 states and 2913 transitions. [2019-12-27 22:35:08,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 22:35:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2913 transitions. [2019-12-27 22:35:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 22:35:08,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:08,726 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] [2019-12-27 22:35:08,726 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash 746008000, now seen corresponding path program 2 times [2019-12-27 22:35:08,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:08,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733848570] [2019-12-27 22:35:08,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:08,815 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 22:35:08,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733848570] [2019-12-27 22:35:08,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:08,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:35:08,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877405897] [2019-12-27 22:35:08,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:08,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:08,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 179 transitions. [2019-12-27 22:35:08,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:08,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:35:08,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:35:08,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:35:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:35:08,947 INFO L87 Difference]: Start difference. First operand 1168 states and 2913 transitions. Second operand 8 states. [2019-12-27 22:35:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:09,052 INFO L93 Difference]: Finished difference Result 1266 states and 3096 transitions. [2019-12-27 22:35:09,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:35:09,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-27 22:35:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:09,056 INFO L225 Difference]: With dead ends: 1266 [2019-12-27 22:35:09,056 INFO L226 Difference]: Without dead ends: 715 [2019-12-27 22:35:09,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:35:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-27 22:35:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 658. [2019-12-27 22:35:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-27 22:35:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1367 transitions. [2019-12-27 22:35:09,068 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1367 transitions. Word has length 44 [2019-12-27 22:35:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:09,068 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1367 transitions. [2019-12-27 22:35:09,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:35:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1367 transitions. [2019-12-27 22:35:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 22:35:09,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:09,070 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] [2019-12-27 22:35:09,071 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1496794208, now seen corresponding path program 3 times [2019-12-27 22:35:09,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:09,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747773839] [2019-12-27 22:35:09,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:35:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:35:09,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:35:09,217 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:35:09,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (let ((.cse1 (store .cse0 |v_~#y~0.base_25| 1))) (and (= 0 v_~y$r_buff1_thd1~0_41) (= 0 v_~__unbuffered_p0_EAX$w_buff0_used~0_8) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~__unbuffered_p0_EAX$mem_tmp~0_6 0) (= 0 (select .cse0 |v_~#y~0.base_25|)) (= v_~y$r_buff0_thd3~0_23 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2213~0.base_25|) 0) (= v_~y$r_buff0_thd0~0_26 0) (= v_~y$read_delayed~0_8 0) (= v_~y$r_buff0_thd1~0_67 0) (= 0 v_~__unbuffered_cnt~0_17) (= 0 (select (select |v_#memory_int_55| |v_~#y~0.base_25|) |v_~#y~0.offset_25|)) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd2~0_6) (= 0 |v_ULTIMATE.start_main_~#t2213~0.offset_20|) (= v_~y$w_buff1_used~0_57 0) (= (store |v_#memory_int_55| |v_ULTIMATE.start_main_~#t2213~0.base_25| (store (select |v_#memory_int_55| |v_ULTIMATE.start_main_~#t2213~0.base_25|) |v_ULTIMATE.start_main_~#t2213~0.offset_20| 0)) |v_#memory_int_54|) (= 0 v_~y$flush_delayed~0_12) (= 0 v_~__unbuffered_p0_EAX$w_buff1_used~0_7) (= 0 v_~y$r_buff1_thd0~0_19) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd0~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd1~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd0~0_5) (= 0 v_~__unbuffered_p0_EAX$w_buff1~0_8) (= 0 v_~__unbuffered_p0_EAX$read_delayed_var~0.base_12) (< |v_#StackHeapBarrier_23| |v_~#y~0.base_25|) (= v_~x~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p0_EAX$w_buff0~0_8) (= |v_#length_36| (store (store |v_#length_37| |v_~#y~0.base_25| 4) |v_ULTIMATE.start_main_~#t2213~0.base_25| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~y$w_buff0_used~0_97) (< 0 |v_#StackHeapBarrier_23|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_p0_EAX$read_delayed~0_13) (= v_~__unbuffered_p0_EAX$flush_delayed~0_7 0) (= v_~y$r_buff1_thd2~0_6 0) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd3~0_5) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t2213~0.base_25|) (= v_~y$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p0_EBX~0_13 0) (= 0 v_~y$w_buff0~0_23) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_12 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd1~0_8) (= 0 v_~weak$$choice2~0_38) (= |v_~#y~0.offset_25| 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd3~0_8) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~weak$$choice1~0_13) (= |v_#valid_73| (store .cse1 |v_ULTIMATE.start_main_~#t2213~0.base_25| 1)) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~y$mem_tmp~0_10 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd2~0_8)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_55|, #length=|v_#length_37|} OutVars{ULTIMATE.start_main_~#t2213~0.base=|v_ULTIMATE.start_main_~#t2213~0.base_25|, ULTIMATE.start_main_#t~mem40=|v_ULTIMATE.start_main_#t~mem40_11|, ~__unbuffered_p0_EAX$r_buff0_thd1~0=v_~__unbuffered_p0_EAX$r_buff0_thd1~0_7, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_17|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ~__unbuffered_p0_EAX$r_buff1_thd3~0=v_~__unbuffered_p0_EAX$r_buff1_thd3~0_8, ULTIMATE.start_main_~#t2213~0.offset=|v_ULTIMATE.start_main_~#t2213~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_17|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~weak$$choice1~0=v_~weak$$choice1~0_13, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_36|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_14|, ~__unbuffered_p0_EAX$w_buff1~0=v_~__unbuffered_p0_EAX$w_buff1~0_8, ~__unbuffered_p0_EAX$r_buff0_thd0~0=v_~__unbuffered_p0_EAX$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX$r_buff1_thd2~0=v_~__unbuffered_p0_EAX$r_buff1_thd2~0_8, ~__unbuffered_p0_EAX$w_buff1_used~0=v_~__unbuffered_p0_EAX$w_buff1_used~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~__unbuffered_p0_EAX$mem_tmp~0=v_~__unbuffered_p0_EAX$mem_tmp~0_6, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~__unbuffered_p0_EAX$r_buff0_thd3~0=v_~__unbuffered_p0_EAX$r_buff0_thd3~0_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_8, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_~#t2214~0.offset=|v_ULTIMATE.start_main_~#t2214~0.offset_21|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_19, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~#y~0.offset=|v_~#y~0.offset_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~__unbuffered_p0_EAX$w_buff0~0=v_~__unbuffered_p0_EAX$w_buff0~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~#y~0.base=|v_~#y~0.base_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ~__unbuffered_p0_EAX$r_buff1_thd1~0=v_~__unbuffered_p0_EAX$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_~#t2215~0.offset=|v_ULTIMATE.start_main_~#t2215~0.offset_20|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_23, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~__unbuffered_p0_EAX$flush_delayed~0=v_~__unbuffered_p0_EAX$flush_delayed~0_7, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_13, ~__unbuffered_p0_EAX$w_buff0_used~0=v_~__unbuffered_p0_EAX$w_buff0_used~0_8, ~__unbuffered_p0_EAX$r_buff0_thd2~0=v_~__unbuffered_p0_EAX$r_buff0_thd2~0_6, ULTIMATE.start_main_~#t2215~0.base=|v_ULTIMATE.start_main_~#t2215~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t2214~0.base=|v_ULTIMATE.start_main_~#t2214~0.base_27|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_12, #NULL.base=|v_#NULL.base_5|, ~__unbuffered_p0_EAX$r_buff1_thd0~0=v_~__unbuffered_p0_EAX$r_buff1_thd0~0_5, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_6, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_54|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_12, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_38, ULTIMATE.start_main_#t~mem48=|v_ULTIMATE.start_main_#t~mem48_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2213~0.base, ULTIMATE.start_main_#t~mem40, ~__unbuffered_p0_EAX$r_buff0_thd1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ~__unbuffered_p0_EAX$r_buff1_thd3~0, ULTIMATE.start_main_~#t2213~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~weak$$choice1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet47, ~__unbuffered_p0_EAX$w_buff1~0, ~__unbuffered_p0_EAX$r_buff0_thd0~0, ~__unbuffered_p0_EAX$r_buff1_thd2~0, ~__unbuffered_p0_EAX$w_buff1_used~0, ~weak$$choice0~0, ~y$w_buff1~0, ~__unbuffered_p0_EAX$mem_tmp~0, ~y$read_delayed_var~0.base, ~__unbuffered_p0_EAX$r_buff0_thd3~0, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2214~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~#y~0.offset, ~y$w_buff0_used~0, ~__unbuffered_p0_EAX$w_buff0~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~#y~0.base, ULTIMATE.start_main_#t~ite42, ~__unbuffered_p0_EAX$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2215~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~__unbuffered_p0_EAX$flush_delayed~0, ~__unbuffered_p0_EAX$read_delayed~0, ~__unbuffered_p0_EAX$w_buff0_used~0, ~__unbuffered_p0_EAX$r_buff0_thd2~0, ULTIMATE.start_main_~#t2215~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2214~0.base, ~__unbuffered_p0_EAX$read_delayed_var~0.base, #NULL.base, ~__unbuffered_p0_EAX$r_buff1_thd0~0, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet37, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_#t~mem48, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:35:09,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-1-->L820: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2214~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2214~0.base_10|) (= |v_ULTIMATE.start_main_~#t2214~0.offset_9| 0) (= (store |v_#memory_int_40| |v_ULTIMATE.start_main_~#t2214~0.base_10| (store (select |v_#memory_int_40| |v_ULTIMATE.start_main_~#t2214~0.base_10|) |v_ULTIMATE.start_main_~#t2214~0.offset_9| 1)) |v_#memory_int_39|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2214~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2214~0.base_10| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2214~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_40|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_39|, ULTIMATE.start_main_#t~nondet37=|v_ULTIMATE.start_main_#t~nondet37_4|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2214~0.base=|v_ULTIMATE.start_main_~#t2214~0.base_10|, ULTIMATE.start_main_~#t2214~0.offset=|v_ULTIMATE.start_main_~#t2214~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet37, #length, ULTIMATE.start_main_~#t2214~0.base, ULTIMATE.start_main_~#t2214~0.offset] because there is no mapped edge [2019-12-27 22:35:09,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L752-->L753: Formula: (and (= v_~y$w_buff0~0_12 v_~y$w_buff0~0_11) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$w_buff0~0=v_~y$w_buff0~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_9|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_8|, ~y$w_buff0~0=v_~y$w_buff0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_17, P0Thread1of1ForFork1_#t~ite11=|v_P0Thread1of1ForFork1_#t~ite11_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite10, P0Thread1of1ForFork1_#t~ite9, ~y$w_buff0~0, P0Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:35:09,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L753-->L754: Formula: (and (= v_~y$w_buff1~0_12 v_~y$w_buff1~0_11) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~y$w_buff1~0=v_~y$w_buff1~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$w_buff1~0=v_~y$w_buff1~0_11, P0Thread1of1ForFork1_#t~ite14=|v_P0Thread1of1ForFork1_#t~ite14_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P0Thread1of1ForFork1_#t~ite13=|v_P0Thread1of1ForFork1_#t~ite13_7|, P0Thread1of1ForFork1_#t~ite12=|v_P0Thread1of1ForFork1_#t~ite12_7|} AuxVars[] AssignedVars[~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite14, P0Thread1of1ForFork1_#t~ite13, P0Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:35:09,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2215~0.base_12|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2215~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t2215~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2215~0.base_12| 0)) (= (store |v_#memory_int_43| |v_ULTIMATE.start_main_~#t2215~0.base_12| (store (select |v_#memory_int_43| |v_ULTIMATE.start_main_~#t2215~0.base_12|) |v_ULTIMATE.start_main_~#t2215~0.offset_10| 2)) |v_#memory_int_42|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2215~0.base_12| 4) |v_#length_21|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2215~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_43|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t2215~0.offset=|v_ULTIMATE.start_main_~#t2215~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t2215~0.base=|v_ULTIMATE.start_main_~#t2215~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2215~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2215~0.base, #length] because there is no mapped edge [2019-12-27 22:35:09,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L756-->L757: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-746845691 ~y$r_buff0_thd1~0_Out-746845691)) (.cse1 (= (mod ~weak$$choice2~0_In-746845691 256) 0))) (or (and .cse0 (not .cse1)) (and (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-746845691 256)))) (or (= (mod ~y$w_buff0_used~0_In-746845691 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-746845691 256)) .cse2) (and .cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-746845691 256))))) .cse0 .cse1))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-746845691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-746845691, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-746845691, ~weak$$choice2~0=~weak$$choice2~0_In-746845691, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746845691} OutVars{P0Thread1of1ForFork1_#t~ite21=|P0Thread1of1ForFork1_#t~ite21_Out-746845691|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-746845691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-746845691, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-746845691, ~weak$$choice2~0=~weak$$choice2~0_In-746845691, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-746845691|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-746845691|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-746845691} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, ~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 22:35:09,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L757-->L761: Formula: (and (= |v_~#y~0.offset_17| v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_4) (= v_~__unbuffered_p0_EAX~0_7 (select (select |v_#memory_int_29| |v_~#y~0.base_17|) |v_~#y~0.offset_17|)) (= v_~y$r_buff1_thd1~0_19 v_~y$r_buff1_thd1~0_20) (= |v_~#y~0.base_17| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_4) (= 1 v_~__unbuffered_p0_EAX$read_delayed~0_6) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~#y~0.offset=|v_~#y~0.offset_17|, #memory_int=|v_#memory_int_29|, ~#y~0.base=|v_~#y~0.base_17|, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~#y~0.offset=|v_~#y~0.offset_17|, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, P0Thread1of1ForFork1_#t~ite26=|v_P0Thread1of1ForFork1_#t~ite26_7|, ~#y~0.base=|v_~#y~0.base_17|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_4, P0Thread1of1ForFork1_#t~mem27=|v_P0Thread1of1ForFork1_#t~mem27_4|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, #memory_int=|v_#memory_int_29|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_4, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_18, P0Thread1of1ForFork1_#t~ite24=|v_P0Thread1of1ForFork1_#t~ite24_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~mem27, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~ite25, P0Thread1of1ForFork1_#t~ite26, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork1_#t~ite24, ~__unbuffered_p0_EAX$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 22:35:09,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L761-->L772: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= (store |v_#memory_int_38| |v_~#y~0.base_20| (store (select |v_#memory_int_38| |v_~#y~0.base_20|) |v_~#y~0.offset_20| v_~y$mem_tmp~0_5)) |v_#memory_int_37|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~__unbuffered_p0_EBX~0_5 v_~x~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~#y~0.offset=|v_~#y~0.offset_20|, #memory_int=|v_#memory_int_38|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~#y~0.base=|v_~#y~0.base_20|, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork1_#t~mem28=|v_P0Thread1of1ForFork1_#t~mem28_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_5, ~#y~0.offset=|v_~#y~0.offset_20|, P0Thread1of1ForFork1_#t~ite29=|v_P0Thread1of1ForFork1_#t~ite29_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, #memory_int=|v_#memory_int_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~#y~0.base=|v_~#y~0.base_20|, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~mem28, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#t~ite29, ~y$flush_delayed~0, #memory_int, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:35:09,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_4 |v_P1Thread1of1ForFork2_#in~arg.offset_4|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 1 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= v_P1Thread1of1ForFork2_~arg.base_4 |v_P1Thread1of1ForFork2_#in~arg.base_4|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_4|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_4|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_4, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_4, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~x~0=v_~x~0_8, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 22:35:09,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L795-2-->L795-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite31_Out-477018432| |P2Thread1of1ForFork0_#t~ite32_Out-477018432|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-477018432 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-477018432 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~mem30_Out-477018432| (select (select |#memory_int_In-477018432| |~#y~0.base_In-477018432|) |~#y~0.offset_In-477018432|)) (= |P2Thread1of1ForFork0_#t~mem30_Out-477018432| |P2Thread1of1ForFork0_#t~ite31_Out-477018432|) (or .cse0 .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~mem30_In-477018432| |P2Thread1of1ForFork0_#t~mem30_Out-477018432|) .cse2 (not .cse0) (= |P2Thread1of1ForFork0_#t~ite31_Out-477018432| ~y$w_buff1~0_In-477018432) (not .cse1)))) InVars {~#y~0.offset=|~#y~0.offset_In-477018432|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-477018432, ~y$w_buff1~0=~y$w_buff1~0_In-477018432, #memory_int=|#memory_int_In-477018432|, ~#y~0.base=|~#y~0.base_In-477018432|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477018432, P2Thread1of1ForFork0_#t~mem30=|P2Thread1of1ForFork0_#t~mem30_In-477018432|} OutVars{~#y~0.offset=|~#y~0.offset_In-477018432|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-477018432, ~y$w_buff1~0=~y$w_buff1~0_In-477018432, P2Thread1of1ForFork0_#t~ite32=|P2Thread1of1ForFork0_#t~ite32_Out-477018432|, #memory_int=|#memory_int_In-477018432|, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out-477018432|, ~#y~0.base=|~#y~0.base_In-477018432|, P2Thread1of1ForFork0_#t~mem30=|P2Thread1of1ForFork0_#t~mem30_Out-477018432|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477018432} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~mem30] because there is no mapped edge [2019-12-27 22:35:09,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-543927389 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-543927389 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite33_Out-543927389|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite33_Out-543927389| ~y$w_buff0_used~0_In-543927389)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-543927389, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-543927389} OutVars{P2Thread1of1ForFork0_#t~ite33=|P2Thread1of1ForFork0_#t~ite33_Out-543927389|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-543927389, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-543927389} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33] because there is no mapped edge [2019-12-27 22:35:09,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1158623471 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1158623471 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1158623471 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1158623471 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite34_Out-1158623471|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1158623471 |P2Thread1of1ForFork0_#t~ite34_Out-1158623471|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1158623471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1158623471, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1158623471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1158623471} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1158623471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1158623471, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1158623471, P2Thread1of1ForFork0_#t~ite34=|P2Thread1of1ForFork0_#t~ite34_Out-1158623471|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1158623471} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 22:35:09,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-504854097 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-504854097 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-504854097 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-504854097 ~y$r_buff0_thd3~0_In-504854097)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-504854097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-504854097} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-504854097, P2Thread1of1ForFork0_#t~ite35=|P2Thread1of1ForFork0_#t~ite35_Out-504854097|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-504854097} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite35, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 22:35:09,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1949067403 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1949067403 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1949067403 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1949067403 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1949067403 |P2Thread1of1ForFork0_#t~ite36_Out1949067403|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite36_Out1949067403|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1949067403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1949067403, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1949067403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1949067403} OutVars{P2Thread1of1ForFork0_#t~ite36=|P2Thread1of1ForFork0_#t~ite36_Out1949067403|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1949067403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1949067403, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1949067403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1949067403} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 22:35:09,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork0_#t~ite36_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite36, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 22:35:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L826-->L828-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_14 256) 0) (= 0 (mod v_~y$w_buff0_used~0_55 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_55, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_55, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:35:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1630505707 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1630505707 256)))) (or (and (= ~y$w_buff1~0_In-1630505707 |ULTIMATE.start_main_#t~ite41_Out-1630505707|) (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~mem40_In-1630505707| |ULTIMATE.start_main_#t~mem40_Out-1630505707|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~mem40_Out-1630505707| |ULTIMATE.start_main_#t~ite41_Out-1630505707|) (= (select (select |#memory_int_In-1630505707| |~#y~0.base_In-1630505707|) |~#y~0.offset_In-1630505707|) |ULTIMATE.start_main_#t~mem40_Out-1630505707|)))) InVars {~#y~0.offset=|~#y~0.offset_In-1630505707|, ~y$w_buff1~0=~y$w_buff1~0_In-1630505707, ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_In-1630505707|, #memory_int=|#memory_int_In-1630505707|, ~#y~0.base=|~#y~0.base_In-1630505707|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1630505707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1630505707} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1630505707|, ~#y~0.offset=|~#y~0.offset_In-1630505707|, ~y$w_buff1~0=~y$w_buff1~0_In-1630505707, ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_Out-1630505707|, #memory_int=|#memory_int_In-1630505707|, ~#y~0.base=|~#y~0.base_In-1630505707|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1630505707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1630505707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~mem40] because there is no mapped edge [2019-12-27 22:35:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L828-4-->L829: Formula: (= (store |v_#memory_int_27| |v_~#y~0.base_15| (store (select |v_#memory_int_27| |v_~#y~0.base_15|) |v_~#y~0.offset_15| |v_ULTIMATE.start_main_#t~ite41_7|)) |v_#memory_int_26|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~#y~0.offset=|v_~#y~0.offset_15|, #memory_int=|v_#memory_int_27|, ~#y~0.base=|v_~#y~0.base_15|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~#y~0.offset=|v_~#y~0.offset_15|, ULTIMATE.start_main_#t~mem40=|v_ULTIMATE.start_main_#t~mem40_4|, #memory_int=|v_#memory_int_26|, ~#y~0.base=|v_~#y~0.base_15|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~mem40, #memory_int, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:35:09,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-803963054 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-803963054 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-803963054 |ULTIMATE.start_main_#t~ite43_Out-803963054|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-803963054|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-803963054, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-803963054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-803963054, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-803963054, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-803963054|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:35:09,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-1285646364 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1285646364 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1285646364 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1285646364 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1285646364| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1285646364| ~y$w_buff1_used~0_In-1285646364) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285646364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1285646364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1285646364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285646364} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285646364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1285646364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1285646364, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1285646364|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285646364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:35:09,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L831-->L832: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-838108223 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-838108223 256) 0))) (or (and (= ~y$r_buff0_thd0~0_Out-838108223 ~y$r_buff0_thd0~0_In-838108223) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd0~0_Out-838108223 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-838108223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-838108223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-838108223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-838108223, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-838108223|} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:35:09,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-->L836: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-735718355 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-735718355 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-735718355 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-735718355 256))) (.cse4 (= |ULTIMATE.start_main_#t~nondet47_In-735718355| ~weak$$choice1~0_Out-735718355))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_Out-735718355 ~y$r_buff1_thd0~0_In-735718355) (or .cse2 .cse3) .cse4) (and (= ~y$r_buff1_thd0~0_Out-735718355 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) .cse4))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-735718355, ULTIMATE.start_main_#t~nondet47=|ULTIMATE.start_main_#t~nondet47_In-735718355|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-735718355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-735718355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-735718355} OutVars{~weak$$choice1~0=~weak$$choice1~0_Out-735718355, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-735718355, ULTIMATE.start_main_#t~nondet47=|ULTIMATE.start_main_#t~nondet47_Out-735718355|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-735718355, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-735718355|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-735718355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-735718355} AuxVars[] AssignedVars[~weak$$choice1~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite46, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 22:35:09,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-1-->L836-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In1488837772 256) 0))) (or (and (= |ULTIMATE.start_main_#t~mem48_In1488837772| |ULTIMATE.start_main_#t~mem48_Out1488837772|) (= |ULTIMATE.start_main_#t~ite49_Out1488837772| ~__unbuffered_p0_EAX~0_In1488837772) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~mem48_Out1488837772| (select (select |#memory_int_In1488837772| ~__unbuffered_p0_EAX$read_delayed_var~0.base_In1488837772) ~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1488837772)) (= |ULTIMATE.start_main_#t~mem48_Out1488837772| |ULTIMATE.start_main_#t~ite49_Out1488837772|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1488837772, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_In1488837772, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1488837772, #memory_int=|#memory_int_In1488837772|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=~__unbuffered_p0_EAX$read_delayed_var~0.base_In1488837772, ULTIMATE.start_main_#t~mem48=|ULTIMATE.start_main_#t~mem48_In1488837772|} OutVars{~weak$$choice1~0=~weak$$choice1~0_In1488837772, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_In1488837772, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1488837772, #memory_int=|#memory_int_In1488837772|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1488837772|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=~__unbuffered_p0_EAX$read_delayed_var~0.base_In1488837772, ULTIMATE.start_main_#t~mem48=|ULTIMATE.start_main_#t~mem48_Out1488837772|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~mem48] because there is no mapped edge [2019-12-27 22:35:09,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L836-3-->L839-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (let ((.cse0 (= v_~__unbuffered_p0_EBX~0_8 0)) (.cse1 (= 1 v_~__unbuffered_p0_EAX~0_12)) (.cse2 (= v_~__unbuffered_p2_EAX~0_7 1))) (or (and .cse0 (= v_~main$tmp_guard1~0_8 0) .cse1 .cse2) (and (or (not .cse0) (not .cse1) (not .cse2)) (= v_~main$tmp_guard1~0_8 1)))) (= |v_ULTIMATE.start_main_#t~ite49_11| v_~__unbuffered_p0_EAX~0_12)) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|} OutVars{ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|, ULTIMATE.start_main_#t~mem48=|v_ULTIMATE.start_main_#t~mem48_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~__unbuffered_p0_EAX~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~mem48] because there is no mapped edge [2019-12-27 22:35:09,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L839-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, 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 22:35:09,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:35:09 BasicIcfg [2019-12-27 22:35:09,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:35:09,362 INFO L168 Benchmark]: Toolchain (without parser) took 21033.52 ms. Allocated memory was 140.0 MB in the beginning and 707.8 MB in the end (delta: 567.8 MB). Free memory was 103.3 MB in the beginning and 614.7 MB in the end (delta: -511.3 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:09,362 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:35:09,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.23 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.9 MB in the beginning and 157.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:09,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.00 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:09,364 INFO L168 Benchmark]: Boogie Preprocessor took 42.88 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:09,365 INFO L168 Benchmark]: RCFGBuilder took 796.26 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 104.4 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:09,366 INFO L168 Benchmark]: TraceAbstraction took 19334.72 ms. Allocated memory was 203.9 MB in the beginning and 707.8 MB in the end (delta: 503.8 MB). Free memory was 104.4 MB in the beginning and 614.7 MB in the end (delta: -510.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 22:35:09,370 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.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.23 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.9 MB in the beginning and 157.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.00 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.88 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.26 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 104.4 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19334.72 ms. Allocated memory was 203.9 MB in the beginning and 707.8 MB in the end (delta: 503.8 MB). Free memory was 104.4 MB in the beginning and 614.7 MB in the end (delta: -510.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 169 ProgramPointsBefore, 71 ProgramPointsAfterwards, 195 TransitionsBefore, 81 TransitionsAfterwards, 11934 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 43 ConcurrentYvCompositions, 20 ChoiceCompositions, 4775 VarBasedMoverChecksPositive, 119 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48599 CheckedPairsTotal, 130 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 y$flush_delayed = weak$$choice2 [L750] EXPR 1 \read(y) [L750] 1 y$mem_tmp = y [L751] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] EXPR 1 \read(y) [L751] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \read(y)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L820] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L822] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 3 __unbuffered_p2_EAX = x [L792] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. Result: UNSAFE, OverallTime: 18.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1089 SDtfs, 1679 SDslu, 2874 SDs, 0 SdLazy, 3168 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 41 SyntacticMatches, 15 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12266occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1873 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 69048 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...