/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:01:43,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:01:43,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:01:44,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:01:44,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:01:44,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:01:44,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:01:44,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:01:44,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:01:44,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:01:44,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:01:44,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:01:44,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:01:44,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:01:44,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:01:44,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:01:44,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:01:44,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:01:44,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:01:44,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:01:44,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:01:44,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:01:44,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:01:44,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:01:44,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:01:44,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:01:44,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:01:44,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:01:44,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:01:44,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:01:44,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:01:44,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:01:44,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:01:44,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:01:44,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:01:44,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:01:44,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:01:44,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:01:44,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:01:44,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:01:44,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:01:44,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:01:44,110 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:01:44,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:01:44,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:01:44,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:01:44,113 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:01:44,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:01:44,113 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:01:44,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:01:44,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:01:44,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:01:44,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:01:44,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:01:44,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:01:44,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:01:44,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:01:44,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:01:44,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:01:44,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:01:44,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:01:44,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:01:44,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:01:44,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:01:44,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:01:44,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:01:44,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:01:44,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:01:44,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:01:44,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:01:44,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:01:44,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:01:44,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:01:44,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:01:44,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:01:44,403 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:01:44,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-27 01:01:44,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454a4a4c7/02d05cf9b56d47df8bdb41905d6a3c1b/FLAGc0fa3a177 [2019-12-27 01:01:45,081 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:01:45,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_power.oepc.i [2019-12-27 01:01:45,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454a4a4c7/02d05cf9b56d47df8bdb41905d6a3c1b/FLAGc0fa3a177 [2019-12-27 01:01:45,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454a4a4c7/02d05cf9b56d47df8bdb41905d6a3c1b [2019-12-27 01:01:45,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:01:45,306 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:01:45,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:01:45,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:01:45,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:01:45,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:01:45" (1/1) ... [2019-12-27 01:01:45,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119636e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:45, skipping insertion in model container [2019-12-27 01:01:45,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:01:45" (1/1) ... [2019-12-27 01:01:45,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:01:45,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:01:45,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:01:45,973 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:01:46,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:01:46,105 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:01:46,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46 WrapperNode [2019-12-27 01:01:46,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:01:46,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:01:46,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:01:46,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:01:46,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:01:46,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:01:46,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:01:46,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:01:46,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (1/1) ... [2019-12-27 01:01:46,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:01:46,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:01:46,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:01:46,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:01:46,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (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 01:01:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:01:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:01:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:01:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:01:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:01:46,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:01:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:01:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:01:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:01:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:01:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:01:46,340 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 01:01:47,314 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:01:47,315 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:01:47,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:01:47 BoogieIcfgContainer [2019-12-27 01:01:47,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:01:47,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:01:47,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:01:47,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:01:47,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:01:45" (1/3) ... [2019-12-27 01:01:47,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3122fefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:01:47, skipping insertion in model container [2019-12-27 01:01:47,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:01:46" (2/3) ... [2019-12-27 01:01:47,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3122fefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:01:47, skipping insertion in model container [2019-12-27 01:01:47,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:01:47" (3/3) ... [2019-12-27 01:01:47,324 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.oepc.i [2019-12-27 01:01:47,334 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:01:47,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:01:47,341 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:01:47,342 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:01:47,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,434 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,472 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,473 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:01:47,493 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:01:47,513 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:01:47,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:01:47,514 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:01:47,514 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:01:47,514 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:01:47,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:01:47,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:01:47,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:01:47,532 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 01:01:47,534 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 01:01:47,683 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 01:01:47,684 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:01:47,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 01:01:47,731 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 01:01:47,794 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 01:01:47,794 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:01:47,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 01:01:47,843 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 01:01:47,844 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:01:53,960 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 01:01:54,070 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 01:01:54,125 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-27 01:01:54,126 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 01:01:54,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-27 01:01:56,053 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-27 01:01:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-27 01:01:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:01:56,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:01:56,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:01:56,063 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:01:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:01:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-27 01:01:56,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:01:56,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945014958] [2019-12-27 01:01:56,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:01:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:01:56,301 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 01:01:56,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945014958] [2019-12-27 01:01:56,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:01:56,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:01:56,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068668572] [2019-12-27 01:01:56,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:01:56,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:01:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:01:56,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:01:56,320 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-27 01:01:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:01:56,883 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-27 01:01:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:01:56,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:01:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:01:57,994 INFO L225 Difference]: With dead ends: 29506 [2019-12-27 01:01:57,995 INFO L226 Difference]: Without dead ends: 27490 [2019-12-27 01:01:57,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:01:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-27 01:01:59,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-27 01:01:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-27 01:01:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-27 01:01:59,450 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-27 01:01:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:01:59,450 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-27 01:01:59,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:01:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-27 01:01:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:01:59,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:01:59,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:01:59,455 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:01:59,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:01:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash -271665278, now seen corresponding path program 1 times [2019-12-27 01:01:59,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:01:59,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961023379] [2019-12-27 01:01:59,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:01:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:01:59,515 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 01:01:59,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961023379] [2019-12-27 01:01:59,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:01:59,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:01:59,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225744922] [2019-12-27 01:01:59,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:01:59,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:01:59,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:01:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:01:59,519 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-27 01:01:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:01:59,584 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-27 01:01:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:01:59,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 01:01:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:01:59,597 INFO L225 Difference]: With dead ends: 3269 [2019-12-27 01:01:59,597 INFO L226 Difference]: Without dead ends: 3269 [2019-12-27 01:01:59,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:01:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-27 01:01:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-27 01:01:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-27 01:01:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-27 01:01:59,684 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-27 01:01:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:01:59,684 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-27 01:01:59,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:01:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-27 01:01:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:01:59,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:01:59,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:01:59,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:01:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:01:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-27 01:01:59,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:01:59,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341913718] [2019-12-27 01:01:59,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:01:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:01:59,814 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 01:01:59,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341913718] [2019-12-27 01:01:59,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:01:59,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:01:59,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60035740] [2019-12-27 01:01:59,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:01:59,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:01:59,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:01:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:01:59,817 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-27 01:02:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:00,097 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-27 01:02:00,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:02:00,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 01:02:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:00,165 INFO L225 Difference]: With dead ends: 4313 [2019-12-27 01:02:00,165 INFO L226 Difference]: Without dead ends: 4313 [2019-12-27 01:02:00,165 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 01:02:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-27 01:02:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-27 01:02:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-27 01:02:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-27 01:02:00,272 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-27 01:02:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:00,273 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-27 01:02:00,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-27 01:02:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 01:02:00,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:00,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:00,278 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:00,279 INFO L82 PathProgramCache]: Analyzing trace with hash 566526627, now seen corresponding path program 1 times [2019-12-27 01:02:00,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:00,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808379789] [2019-12-27 01:02:00,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:00,357 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 01:02:00,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808379789] [2019-12-27 01:02:00,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:00,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:00,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763929432] [2019-12-27 01:02:00,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:00,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:00,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:00,360 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-27 01:02:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:00,463 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-27 01:02:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:00,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 01:02:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:00,482 INFO L225 Difference]: With dead ends: 7552 [2019-12-27 01:02:00,483 INFO L226 Difference]: Without dead ends: 7552 [2019-12-27 01:02:00,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-27 01:02:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-27 01:02:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-27 01:02:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-27 01:02:00,625 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-27 01:02:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:00,625 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-27 01:02:00,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-27 01:02:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 01:02:00,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:00,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:00,628 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:00,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:00,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1206588916, now seen corresponding path program 1 times [2019-12-27 01:02:00,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:00,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58959574] [2019-12-27 01:02:00,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:00,679 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 01:02:00,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58959574] [2019-12-27 01:02:00,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:00,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:02:00,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043487268] [2019-12-27 01:02:00,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:00,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:00,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:00,682 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-27 01:02:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:01,003 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-27 01:02:01,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:02:01,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 01:02:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:01,025 INFO L225 Difference]: With dead ends: 7957 [2019-12-27 01:02:01,025 INFO L226 Difference]: Without dead ends: 7957 [2019-12-27 01:02:01,026 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 01:02:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-27 01:02:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-27 01:02:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-27 01:02:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-27 01:02:01,183 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-27 01:02:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:01,183 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-27 01:02:01,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-27 01:02:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:02:01,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:01,189 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] [2019-12-27 01:02:01,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:01,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:01,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1293061293, now seen corresponding path program 1 times [2019-12-27 01:02:01,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:01,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419125928] [2019-12-27 01:02:01,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:01,264 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 01:02:01,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419125928] [2019-12-27 01:02:01,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:01,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:01,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703739067] [2019-12-27 01:02:01,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:01,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:01,267 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-27 01:02:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:01,719 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-27 01:02:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:02:01,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:02:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:01,736 INFO L225 Difference]: With dead ends: 8876 [2019-12-27 01:02:01,737 INFO L226 Difference]: Without dead ends: 8876 [2019-12-27 01:02:01,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:02:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-27 01:02:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-27 01:02:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-27 01:02:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-27 01:02:01,990 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-27 01:02:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:01,991 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-27 01:02:01,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-27 01:02:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 01:02:01,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:01,999 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 01:02:01,999 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1277893089, now seen corresponding path program 1 times [2019-12-27 01:02:02,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:02,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745638031] [2019-12-27 01:02:02,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:02,047 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 01:02:02,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745638031] [2019-12-27 01:02:02,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:02,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:02,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080177062] [2019-12-27 01:02:02,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:02,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:02,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:02,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:02,049 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-27 01:02:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:02,138 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-27 01:02:02,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:02,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 01:02:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:02,153 INFO L225 Difference]: With dead ends: 9584 [2019-12-27 01:02:02,153 INFO L226 Difference]: Without dead ends: 9584 [2019-12-27 01:02:02,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-27 01:02:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-27 01:02:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-27 01:02:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-27 01:02:02,338 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-27 01:02:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:02,339 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-27 01:02:02,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-27 01:02:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:02:02,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:02,350 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] [2019-12-27 01:02:02,350 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:02,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1657093328, now seen corresponding path program 1 times [2019-12-27 01:02:02,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:02,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869683562] [2019-12-27 01:02:02,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:02:02,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869683562] [2019-12-27 01:02:02,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:02,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:02,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933218046] [2019-12-27 01:02:02,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:02,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:02,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:02,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:02,497 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-27 01:02:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:02,929 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-27 01:02:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:02:02,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 01:02:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:02,943 INFO L225 Difference]: With dead ends: 9537 [2019-12-27 01:02:02,944 INFO L226 Difference]: Without dead ends: 9537 [2019-12-27 01:02:02,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:02:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-27 01:02:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-27 01:02:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-27 01:02:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-27 01:02:03,106 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-27 01:02:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:03,106 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-27 01:02:03,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-27 01:02:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:02:03,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:03,120 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] [2019-12-27 01:02:03,120 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1233120795, now seen corresponding path program 1 times [2019-12-27 01:02:03,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:03,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726051244] [2019-12-27 01:02:03,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:03,187 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 01:02:03,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726051244] [2019-12-27 01:02:03,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:03,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:03,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107259505] [2019-12-27 01:02:03,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:03,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:03,189 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-27 01:02:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:03,231 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-27 01:02:03,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:02:03,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 01:02:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:03,238 INFO L225 Difference]: With dead ends: 5263 [2019-12-27 01:02:03,238 INFO L226 Difference]: Without dead ends: 5263 [2019-12-27 01:02:03,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-27 01:02:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-27 01:02:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-27 01:02:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-27 01:02:03,360 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-27 01:02:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:03,361 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-27 01:02:03,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-27 01:02:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 01:02:03,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:03,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:03,378 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash 184713789, now seen corresponding path program 1 times [2019-12-27 01:02:03,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:03,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877132625] [2019-12-27 01:02:03,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:03,642 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 01:02:03,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877132625] [2019-12-27 01:02:03,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:03,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:02:03,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892273999] [2019-12-27 01:02:03,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:02:03,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:02:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:02:03,645 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 8 states. [2019-12-27 01:02:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:04,147 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-27 01:02:04,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:02:04,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-27 01:02:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:04,156 INFO L225 Difference]: With dead ends: 9824 [2019-12-27 01:02:04,157 INFO L226 Difference]: Without dead ends: 8719 [2019-12-27 01:02:04,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:02:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-27 01:02:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-27 01:02:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-27 01:02:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-27 01:02:04,290 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-27 01:02:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:04,290 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-27 01:02:04,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:02:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-27 01:02:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 01:02:04,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:04,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:04,310 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1779092541, now seen corresponding path program 2 times [2019-12-27 01:02:04,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:04,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339426236] [2019-12-27 01:02:04,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:04,425 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 01:02:04,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339426236] [2019-12-27 01:02:04,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:04,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:04,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443838455] [2019-12-27 01:02:04,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:02:04,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:02:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:04,428 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 5 states. [2019-12-27 01:02:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:04,560 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-27 01:02:04,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:02:04,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 01:02:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:04,572 INFO L225 Difference]: With dead ends: 9381 [2019-12-27 01:02:04,572 INFO L226 Difference]: Without dead ends: 7879 [2019-12-27 01:02:04,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:02:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-27 01:02:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-27 01:02:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-27 01:02:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-27 01:02:04,693 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-27 01:02:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:04,694 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-27 01:02:04,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:02:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-27 01:02:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 01:02:04,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:04,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:04,710 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 89330341, now seen corresponding path program 3 times [2019-12-27 01:02:04,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:04,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787719933] [2019-12-27 01:02:04,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:04,873 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 01:02:04,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787719933] [2019-12-27 01:02:04,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:04,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:02:04,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84835618] [2019-12-27 01:02:04,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:02:04,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:02:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:02:04,875 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 8 states. [2019-12-27 01:02:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:05,331 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-27 01:02:05,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:02:05,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-27 01:02:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:05,345 INFO L225 Difference]: With dead ends: 11922 [2019-12-27 01:02:05,345 INFO L226 Difference]: Without dead ends: 11455 [2019-12-27 01:02:05,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:02:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-27 01:02:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-27 01:02:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-27 01:02:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-27 01:02:05,598 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-27 01:02:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:05,598 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-27 01:02:05,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:02:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-27 01:02:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 01:02:05,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:05,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:05,614 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1465739931, now seen corresponding path program 4 times [2019-12-27 01:02:05,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:05,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552795714] [2019-12-27 01:02:05,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:05,707 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 01:02:05,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552795714] [2019-12-27 01:02:05,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:05,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:05,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521026447] [2019-12-27 01:02:05,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:05,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:05,709 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 4 states. [2019-12-27 01:02:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:05,748 INFO L93 Difference]: Finished difference Result 8537 states and 19081 transitions. [2019-12-27 01:02:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:02:05,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 01:02:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:05,750 INFO L225 Difference]: With dead ends: 8537 [2019-12-27 01:02:05,750 INFO L226 Difference]: Without dead ends: 890 [2019-12-27 01:02:05,755 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 01:02:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-27 01:02:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2019-12-27 01:02:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 01:02:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-27 01:02:05,767 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-27 01:02:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:05,768 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-27 01:02:05,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-27 01:02:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 01:02:05,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:05,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:05,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash 542114771, now seen corresponding path program 1 times [2019-12-27 01:02:05,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:05,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921635040] [2019-12-27 01:02:05,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:05,843 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 01:02:05,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921635040] [2019-12-27 01:02:05,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:05,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:02:05,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247666719] [2019-12-27 01:02:05,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:02:05,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:05,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:02:05,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:02:05,845 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 4 states. [2019-12-27 01:02:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:05,914 INFO L93 Difference]: Finished difference Result 1011 states and 2091 transitions. [2019-12-27 01:02:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:02:05,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 01:02:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:05,916 INFO L225 Difference]: With dead ends: 1011 [2019-12-27 01:02:05,916 INFO L226 Difference]: Without dead ends: 1011 [2019-12-27 01:02:05,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:02:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-27 01:02:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 923. [2019-12-27 01:02:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 01:02:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1915 transitions. [2019-12-27 01:02:05,930 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1915 transitions. Word has length 69 [2019-12-27 01:02:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:05,930 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1915 transitions. [2019-12-27 01:02:05,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:02:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1915 transitions. [2019-12-27 01:02:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 01:02:05,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:05,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:05,933 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash 378733993, now seen corresponding path program 1 times [2019-12-27 01:02:05,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:05,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789236123] [2019-12-27 01:02:05,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:06,158 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 01:02:06,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789236123] [2019-12-27 01:02:06,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:06,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:02:06,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959793114] [2019-12-27 01:02:06,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:02:06,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:06,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:02:06,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:02:06,161 INFO L87 Difference]: Start difference. First operand 923 states and 1915 transitions. Second operand 10 states. [2019-12-27 01:02:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:06,907 INFO L93 Difference]: Finished difference Result 1508 states and 2961 transitions. [2019-12-27 01:02:06,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:02:06,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-27 01:02:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:06,910 INFO L225 Difference]: With dead ends: 1508 [2019-12-27 01:02:06,910 INFO L226 Difference]: Without dead ends: 1484 [2019-12-27 01:02:06,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:02:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2019-12-27 01:02:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1287. [2019-12-27 01:02:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-12-27 01:02:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2567 transitions. [2019-12-27 01:02:06,940 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2567 transitions. Word has length 70 [2019-12-27 01:02:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:06,940 INFO L462 AbstractCegarLoop]: Abstraction has 1287 states and 2567 transitions. [2019-12-27 01:02:06,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:02:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2567 transitions. [2019-12-27 01:02:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 01:02:06,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:06,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:06,943 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1282533711, now seen corresponding path program 2 times [2019-12-27 01:02:06,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:06,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721365593] [2019-12-27 01:02:06,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:02:07,056 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 01:02:07,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721365593] [2019-12-27 01:02:07,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:02:07,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:02:07,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744712568] [2019-12-27 01:02:07,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:02:07,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:02:07,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:02:07,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:02:07,060 INFO L87 Difference]: Start difference. First operand 1287 states and 2567 transitions. Second operand 3 states. [2019-12-27 01:02:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:02:07,073 INFO L93 Difference]: Finished difference Result 1287 states and 2566 transitions. [2019-12-27 01:02:07,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:02:07,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 01:02:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:02:07,076 INFO L225 Difference]: With dead ends: 1287 [2019-12-27 01:02:07,076 INFO L226 Difference]: Without dead ends: 1287 [2019-12-27 01:02:07,076 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 01:02:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-12-27 01:02:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1109. [2019-12-27 01:02:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-12-27 01:02:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 2238 transitions. [2019-12-27 01:02:07,094 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 2238 transitions. Word has length 70 [2019-12-27 01:02:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:02:07,095 INFO L462 AbstractCegarLoop]: Abstraction has 1109 states and 2238 transitions. [2019-12-27 01:02:07,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:02:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 2238 transitions. [2019-12-27 01:02:07,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 01:02:07,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:02:07,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:02:07,097 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:02:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:02:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1762924738, now seen corresponding path program 1 times [2019-12-27 01:02:07,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:02:07,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515735526] [2019-12-27 01:02:07,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:02:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:02:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:02:07,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:02:07,306 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:02:07,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t0~0.base_51|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_51|) |v_ULTIMATE.start_main_~#t0~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t0~0.base_51| 4)) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t0~0.offset_32| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_51| 1)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_997, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_32|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_51|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_254, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_~#t0~0.offset, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t0~0.base, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:02:07,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1~0.base_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t1~0.base_11| 0)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 01:02:07,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~y~0_In-859779493 ~y$mem_tmp~0_Out-859779493) (= |P0Thread1of1ForFork1_#t~nondet3_In-859779493| ~weak$$choice0~0_Out-859779493) (= ~y$r_buff1_thd0~0_Out-859779493 ~y$r_buff0_thd0~0_In-859779493) (= ~y$r_buff0_thd1~0_Out-859779493 1) (= ~weak$$choice2~0_Out-859779493 ~y$flush_delayed~0_Out-859779493) (= ~weak$$choice2~0_Out-859779493 |P0Thread1of1ForFork1_#t~nondet4_In-859779493|) (= ~y$r_buff1_thd2~0_Out-859779493 ~y$r_buff0_thd2~0_In-859779493) (= ~y$r_buff0_thd1~0_In-859779493 ~y$r_buff1_thd1~0_Out-859779493) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-859779493 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-859779493, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-859779493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-859779493, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-859779493, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-859779493|, ~y~0=~y~0_In-859779493, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-859779493|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-859779493, ~weak$$choice0~0=~weak$$choice0~0_Out-859779493, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-859779493, ~y$mem_tmp~0=~y$mem_tmp~0_Out-859779493, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-859779493, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-859779493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-859779493, ~y$flush_delayed~0=~y$flush_delayed~0_Out-859779493, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-859779493, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-859779493|, ~y~0=~y~0_In-859779493, ~weak$$choice2~0=~weak$$choice2~0_Out-859779493, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-859779493|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-859779493} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 01:02:07,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out1145621591| |P0Thread1of1ForFork1_#t~ite6_Out1145621591|)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1145621591 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1145621591 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out1145621591| ~y$w_buff1~0_In1145621591) (or .cse0 .cse1) .cse2) (and .cse2 (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1145621591| ~y$w_buff0~0_In1145621591) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1145621591, ~y$w_buff1~0=~y$w_buff1~0_In1145621591, ~y$w_buff0~0=~y$w_buff0~0_In1145621591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1145621591} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1145621591|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1145621591, ~y$w_buff1~0=~y$w_buff1~0_In1145621591, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1145621591|, ~y$w_buff0~0=~y$w_buff0~0_In1145621591, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1145621591} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:02:07,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:02:07,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1842273139 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite25_Out-1842273139| ~y$mem_tmp~0_In-1842273139) (not .cse0)) (and (= |P0Thread1of1ForFork1_#t~ite25_Out-1842273139| ~y~0_In-1842273139) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1842273139, ~y$flush_delayed~0=~y$flush_delayed~0_In-1842273139, ~y~0=~y~0_In-1842273139} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1842273139, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-1842273139|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1842273139, ~y~0=~y~0_In-1842273139} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 01:02:07,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-189381365 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out-189381365| ~y~0_In-189381365) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out-189381365| ~y$mem_tmp~0_In-189381365)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-189381365, ~y$flush_delayed~0=~y$flush_delayed~0_In-189381365, ~y~0=~y~0_In-189381365} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-189381365, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-189381365|, ~y$flush_delayed~0=~y$flush_delayed~0_In-189381365, ~y~0=~y~0_In-189381365} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 01:02:07,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In890752600 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In890752600 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out890752600|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In890752600 |P0Thread1of1ForFork1_#t~ite28_Out890752600|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In890752600, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In890752600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In890752600, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out890752600|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In890752600} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:02:07,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1296554729 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1296554729 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1296554729 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1296554729 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite29_Out-1296554729| ~y$w_buff1_used~0_In-1296554729) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite29_Out-1296554729| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1296554729, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1296554729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1296554729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1296554729} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1296554729, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1296554729, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-1296554729|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1296554729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1296554729} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 01:02:07,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-2123981054 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2123981054 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-2123981054 ~y$r_buff0_thd1~0_Out-2123981054)) (and (= 0 ~y$r_buff0_thd1~0_Out-2123981054) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2123981054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2123981054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2123981054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2123981054, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-2123981054|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 01:02:07,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In-610385696 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-610385696 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-610385696 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-610385696 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-610385696 |P0Thread1of1ForFork1_#t~ite31_Out-610385696|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite31_Out-610385696| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-610385696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-610385696, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-610385696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-610385696} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-610385696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-610385696, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-610385696, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-610385696|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-610385696} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 01:02:07,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 01:02:07,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-318738056 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-318738056 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-318738056 |P1Thread1of1ForFork0_#t~ite55_Out-318738056|)) (and (= ~y$w_buff1~0_In-318738056 |P1Thread1of1ForFork0_#t~ite55_Out-318738056|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-318738056, ~y$w_buff1~0=~y$w_buff1~0_In-318738056, ~y~0=~y~0_In-318738056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-318738056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-318738056, ~y$w_buff1~0=~y$w_buff1~0_In-318738056, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-318738056|, ~y~0=~y~0_In-318738056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-318738056} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 01:02:07,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-27 01:02:07,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1631499805 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1631499805 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out-1631499805|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1631499805 |P1Thread1of1ForFork0_#t~ite57_Out-1631499805|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1631499805, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1631499805} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1631499805, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1631499805, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-1631499805|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 01:02:07,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In943415555 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In943415555 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In943415555 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In943415555 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out943415555| ~y$w_buff1_used~0_In943415555) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite58_Out943415555| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In943415555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In943415555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In943415555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943415555} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In943415555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In943415555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In943415555, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out943415555|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In943415555} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 01:02:07,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In905747705 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In905747705 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite59_Out905747705| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite59_Out905747705| ~y$r_buff0_thd2~0_In905747705) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In905747705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In905747705} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In905747705, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In905747705, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out905747705|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 01:02:07,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-347335636 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-347335636 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-347335636 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-347335636 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out-347335636| ~y$r_buff1_thd2~0_In-347335636) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite60_Out-347335636|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-347335636, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347335636, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-347335636, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347335636} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-347335636, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-347335636, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-347335636|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-347335636, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-347335636} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 01:02:07,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 01:02:07,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:02:07,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-669105684| |ULTIMATE.start_main_#t~ite63_Out-669105684|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-669105684 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-669105684 256)))) (or (and (= ~y$w_buff1~0_In-669105684 |ULTIMATE.start_main_#t~ite63_Out-669105684|) (not .cse0) (not .cse1) .cse2) (and (= ~y~0_In-669105684 |ULTIMATE.start_main_#t~ite63_Out-669105684|) .cse2 (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-669105684, ~y~0=~y~0_In-669105684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-669105684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669105684} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-669105684|, ~y$w_buff1~0=~y$w_buff1~0_In-669105684, ~y~0=~y~0_In-669105684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-669105684, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-669105684|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669105684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 01:02:07,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In621789107 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In621789107 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out621789107| ~y$w_buff0_used~0_In621789107) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite65_Out621789107| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In621789107, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In621789107} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In621789107, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In621789107, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out621789107|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 01:02:07,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1652016215 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1652016215 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1652016215 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1652016215 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1652016215 |ULTIMATE.start_main_#t~ite66_Out1652016215|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite66_Out1652016215|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1652016215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1652016215, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1652016215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1652016215} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1652016215, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1652016215, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1652016215|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1652016215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1652016215} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 01:02:07,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In465709648 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In465709648 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out465709648| ~y$r_buff0_thd0~0_In465709648)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out465709648| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In465709648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In465709648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In465709648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In465709648, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out465709648|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 01:02:07,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1428628207 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1428628207 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1428628207 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1428628207 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1428628207 |ULTIMATE.start_main_#t~ite68_Out-1428628207|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-1428628207|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1428628207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1428628207, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1428628207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1428628207} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1428628207, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1428628207, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1428628207|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1428628207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1428628207} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 01:02:07,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~__unbuffered_p0_EBX~0_46 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:02:07,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:02:07 BasicIcfg [2019-12-27 01:02:07,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:02:07,487 INFO L168 Benchmark]: Toolchain (without parser) took 22181.02 ms. Allocated memory was 140.0 MB in the beginning and 774.4 MB in the end (delta: 634.4 MB). Free memory was 101.8 MB in the beginning and 262.0 MB in the end (delta: -160.1 MB). Peak memory consumption was 474.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:07,488 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:02:07,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.72 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:07,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:07,490 INFO L168 Benchmark]: Boogie Preprocessor took 42.24 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 151.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 01:02:07,491 INFO L168 Benchmark]: RCFGBuilder took 1098.66 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 95.2 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:07,491 INFO L168 Benchmark]: TraceAbstraction took 20168.17 ms. Allocated memory was 203.9 MB in the beginning and 774.4 MB in the end (delta: 570.4 MB). Free memory was 94.6 MB in the beginning and 262.0 MB in the end (delta: -167.4 MB). Peak memory consumption was 403.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:02:07,495 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.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.72 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 157.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 154.0 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.24 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1098.66 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 95.2 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20168.17 ms. Allocated memory was 203.9 MB in the beginning and 774.4 MB in the end (delta: 570.4 MB). Free memory was 94.6 MB in the beginning and 262.0 MB in the end (delta: -167.4 MB). Peak memory consumption was 403.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9684 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 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(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L820] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L744] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 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) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] 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_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 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)) [L748] 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_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 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)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3749 SDtfs, 2993 SDslu, 8533 SDs, 0 SdLazy, 2664 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred 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: 3.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 12597 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 654 ConstructedInterpolants, 0 QuantifiedInterpolants, 114166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...