/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:55:27,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:55:27,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:55:27,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:55:27,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:55:27,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:55:27,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:55:27,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:55:27,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:55:27,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:55:27,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:55:27,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:55:27,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:55:27,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:55:27,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:55:27,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:55:27,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:55:27,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:55:27,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:55:27,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:55:27,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:55:27,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:55:27,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:55:27,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:55:27,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:55:27,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:55:27,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:55:27,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:55:27,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:55:27,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:55:27,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:55:27,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:55:27,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:55:27,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:55:27,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:55:27,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:55:27,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:55:27,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:55:27,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:55:27,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:55:27,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:55:27,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:55:27,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:55:27,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:55:27,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:55:27,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:55:27,170 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:55:27,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:55:27,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:55:27,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:55:27,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:55:27,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:55:27,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:55:27,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:55:27,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:55:27,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:55:27,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:55:27,173 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:55:27,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:55:27,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:55:27,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:55:27,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:55:27,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:55:27,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:55:27,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:55:27,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:55:27,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:55:27,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:55:27,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:55:27,175 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:55:27,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:55:27,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:55:27,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:55:27,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:55:27,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:55:27,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:55:27,503 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:55:27,504 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_pso.opt.i [2019-12-18 21:55:27,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47bcfc4e7/93c96cd881344bc69e536a8bae936536/FLAG2b486d2bc [2019-12-18 21:55:28,118 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:55:28,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_pso.opt.i [2019-12-18 21:55:28,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47bcfc4e7/93c96cd881344bc69e536a8bae936536/FLAG2b486d2bc [2019-12-18 21:55:28,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47bcfc4e7/93c96cd881344bc69e536a8bae936536 [2019-12-18 21:55:28,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:55:28,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:55:28,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:55:28,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:55:28,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:55:28,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:55:28" (1/1) ... [2019-12-18 21:55:28,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b12efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:28, skipping insertion in model container [2019-12-18 21:55:28,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:55:28" (1/1) ... [2019-12-18 21:55:28,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:55:28,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:55:28,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:55:28,989 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:55:29,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:55:29,134 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:55:29,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29 WrapperNode [2019-12-18 21:55:29,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:55:29,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:55:29,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:55:29,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:55:29,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:55:29,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:55:29,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:55:29,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:55:29,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (1/1) ... [2019-12-18 21:55:29,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:55:29,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:55:29,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:55:29,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:55:29,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (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-18 21:55:29,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:55:29,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:55:29,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:55:29,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:55:29,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:55:29,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:55:29,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:55:29,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:55:29,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:55:29,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:55:29,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:55:29,302 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:55:30,014 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:55:30,015 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:55:30,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:55:30 BoogieIcfgContainer [2019-12-18 21:55:30,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:55:30,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:55:30,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:55:30,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:55:30,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:55:28" (1/3) ... [2019-12-18 21:55:30,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76284a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:55:30, skipping insertion in model container [2019-12-18 21:55:30,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:55:29" (2/3) ... [2019-12-18 21:55:30,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76284a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:55:30, skipping insertion in model container [2019-12-18 21:55:30,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:55:30" (3/3) ... [2019-12-18 21:55:30,026 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_pso.opt.i [2019-12-18 21:55:30,037 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:55:30,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:55:30,045 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:55:30,047 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:55:30,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,088 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,088 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,088 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,099 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,100 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,151 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,159 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:55:30,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:55:30,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:55:30,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:55:30,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:55:30,197 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:55:30,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:55:30,197 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:55:30,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:55:30,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:55:30,215 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 21:55:30,217 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:55:30,295 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:55:30,296 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:55:30,310 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:55:30,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:55:30,382 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:55:30,382 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:55:30,391 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:55:30,407 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:55:30,408 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:55:33,781 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:55:33,890 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 21:55:33,919 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-18 21:55:33,920 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:55:33,923 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 21:55:34,345 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 21:55:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 21:55:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:55:34,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:34,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:55:34,355 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-18 21:55:34,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:34,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687044202] [2019-12-18 21:55:34,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:34,595 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-18 21:55:34,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687044202] [2019-12-18 21:55:34,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:34,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:55:34,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098048397] [2019-12-18 21:55:34,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:55:34,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:34,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:55:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:55:34,630 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 21:55:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:34,930 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-18 21:55:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:55:34,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:55:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:35,010 INFO L225 Difference]: With dead ends: 7864 [2019-12-18 21:55:35,011 INFO L226 Difference]: Without dead ends: 7408 [2019-12-18 21:55:35,012 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-18 21:55:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-18 21:55:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-18 21:55:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-18 21:55:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-18 21:55:35,536 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-18 21:55:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:35,536 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-18 21:55:35,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:55:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-18 21:55:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:55:35,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:35,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:35,540 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-18 21:55:35,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:35,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867509909] [2019-12-18 21:55:35,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:35,638 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-18 21:55:35,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867509909] [2019-12-18 21:55:35,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:35,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:55:35,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118205234] [2019-12-18 21:55:35,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:55:35,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:35,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:55:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:55:35,642 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-18 21:55:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:36,118 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-18 21:55:36,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:55:36,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:55:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:36,199 INFO L225 Difference]: With dead ends: 11318 [2019-12-18 21:55:36,200 INFO L226 Difference]: Without dead ends: 11311 [2019-12-18 21:55:36,201 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-18 21:55:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-18 21:55:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-18 21:55:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-18 21:55:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-18 21:55:36,710 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-18 21:55:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:36,710 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-18 21:55:36,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:55:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-18 21:55:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:55:36,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:36,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:36,716 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:36,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-18 21:55:36,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:36,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876353296] [2019-12-18 21:55:36,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:36,798 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-18 21:55:36,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876353296] [2019-12-18 21:55:36,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:36,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:55:36,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042988639] [2019-12-18 21:55:36,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:55:36,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:55:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:55:36,802 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-18 21:55:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:37,132 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-18 21:55:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:55:37,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:55:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:37,179 INFO L225 Difference]: With dead ends: 14191 [2019-12-18 21:55:37,180 INFO L226 Difference]: Without dead ends: 14191 [2019-12-18 21:55:37,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-18 21:55:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-18 21:55:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-18 21:55:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-18 21:55:38,194 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-18 21:55:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:38,196 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-18 21:55:38,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:55:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-18 21:55:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:55:38,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:38,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:38,200 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-18 21:55:38,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:38,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776809224] [2019-12-18 21:55:38,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:38,286 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-18 21:55:38,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776809224] [2019-12-18 21:55:38,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:38,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:55:38,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977205693] [2019-12-18 21:55:38,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:55:38,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:55:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:55:38,290 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 3 states. [2019-12-18 21:55:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:38,360 INFO L93 Difference]: Finished difference Result 10482 states and 32382 transitions. [2019-12-18 21:55:38,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:55:38,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:55:38,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:38,396 INFO L225 Difference]: With dead ends: 10482 [2019-12-18 21:55:38,396 INFO L226 Difference]: Without dead ends: 10482 [2019-12-18 21:55:38,396 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-18 21:55:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10482 states. [2019-12-18 21:55:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10482 to 10402. [2019-12-18 21:55:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10402 states. [2019-12-18 21:55:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10402 states to 10402 states and 32150 transitions. [2019-12-18 21:55:38,806 INFO L78 Accepts]: Start accepts. Automaton has 10402 states and 32150 transitions. Word has length 16 [2019-12-18 21:55:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:38,807 INFO L462 AbstractCegarLoop]: Abstraction has 10402 states and 32150 transitions. [2019-12-18 21:55:38,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:55:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 10402 states and 32150 transitions. [2019-12-18 21:55:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:55:38,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:38,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:38,811 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1689443989, now seen corresponding path program 1 times [2019-12-18 21:55:38,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:38,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565869299] [2019-12-18 21:55:38,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:38,892 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-18 21:55:38,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565869299] [2019-12-18 21:55:38,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:38,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:55:38,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44461035] [2019-12-18 21:55:38,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:55:38,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:38,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:55:38,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:55:38,894 INFO L87 Difference]: Start difference. First operand 10402 states and 32150 transitions. Second operand 4 states. [2019-12-18 21:55:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:38,929 INFO L93 Difference]: Finished difference Result 2018 states and 4994 transitions. [2019-12-18 21:55:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:55:38,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:55:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:38,934 INFO L225 Difference]: With dead ends: 2018 [2019-12-18 21:55:38,934 INFO L226 Difference]: Without dead ends: 1434 [2019-12-18 21:55:38,935 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-18 21:55:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-12-18 21:55:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2019-12-18 21:55:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-12-18 21:55:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 3141 transitions. [2019-12-18 21:55:38,962 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 3141 transitions. Word has length 16 [2019-12-18 21:55:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:38,963 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 3141 transitions. [2019-12-18 21:55:38,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:55:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 3141 transitions. [2019-12-18 21:55:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:55:38,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:38,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:38,965 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-18 21:55:38,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:38,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669802609] [2019-12-18 21:55:38,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:39,098 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-18 21:55:39,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669802609] [2019-12-18 21:55:39,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:39,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:55:39,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325996219] [2019-12-18 21:55:39,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:55:39,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:39,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:55:39,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:55:39,100 INFO L87 Difference]: Start difference. First operand 1434 states and 3141 transitions. Second operand 6 states. [2019-12-18 21:55:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:39,468 INFO L93 Difference]: Finished difference Result 2226 states and 4691 transitions. [2019-12-18 21:55:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:55:39,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:55:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:39,474 INFO L225 Difference]: With dead ends: 2226 [2019-12-18 21:55:39,474 INFO L226 Difference]: Without dead ends: 2173 [2019-12-18 21:55:39,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:55:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-12-18 21:55:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1404. [2019-12-18 21:55:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-12-18 21:55:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 3075 transitions. [2019-12-18 21:55:39,506 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 3075 transitions. Word has length 25 [2019-12-18 21:55:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:39,507 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 3075 transitions. [2019-12-18 21:55:39,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:55:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 3075 transitions. [2019-12-18 21:55:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:55:39,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:39,510 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-18 21:55:39,510 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-18 21:55:39,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:39,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672472643] [2019-12-18 21:55:39,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:39,665 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-18 21:55:39,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672472643] [2019-12-18 21:55:39,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:39,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:55:39,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862153395] [2019-12-18 21:55:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:55:39,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:55:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:55:39,669 INFO L87 Difference]: Start difference. First operand 1404 states and 3075 transitions. Second operand 5 states. [2019-12-18 21:55:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:39,710 INFO L93 Difference]: Finished difference Result 739 states and 1600 transitions. [2019-12-18 21:55:39,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:55:39,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:55:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:39,713 INFO L225 Difference]: With dead ends: 739 [2019-12-18 21:55:39,713 INFO L226 Difference]: Without dead ends: 677 [2019-12-18 21:55:39,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-18 21:55:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2019-12-18 21:55:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-18 21:55:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1465 transitions. [2019-12-18 21:55:39,726 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1465 transitions. Word has length 27 [2019-12-18 21:55:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:39,727 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1465 transitions. [2019-12-18 21:55:39,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:55:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1465 transitions. [2019-12-18 21:55:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:55:39,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:39,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:39,734 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1271151221, now seen corresponding path program 1 times [2019-12-18 21:55:39,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:39,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455076932] [2019-12-18 21:55:39,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:39,868 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-18 21:55:39,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455076932] [2019-12-18 21:55:39,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:39,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:55:39,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228424450] [2019-12-18 21:55:39,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:55:39,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:55:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:39,871 INFO L87 Difference]: Start difference. First operand 677 states and 1465 transitions. Second operand 7 states. [2019-12-18 21:55:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:40,198 INFO L93 Difference]: Finished difference Result 2064 states and 4333 transitions. [2019-12-18 21:55:40,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:55:40,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:55:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:40,202 INFO L225 Difference]: With dead ends: 2064 [2019-12-18 21:55:40,202 INFO L226 Difference]: Without dead ends: 1442 [2019-12-18 21:55:40,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:55:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-12-18 21:55:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 741. [2019-12-18 21:55:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-18 21:55:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1602 transitions. [2019-12-18 21:55:40,221 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1602 transitions. Word has length 52 [2019-12-18 21:55:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:40,221 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1602 transitions. [2019-12-18 21:55:40,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:55:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1602 transitions. [2019-12-18 21:55:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:55:40,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:40,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:40,224 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash -196823289, now seen corresponding path program 2 times [2019-12-18 21:55:40,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:40,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358914122] [2019-12-18 21:55:40,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:40,314 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-18 21:55:40,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358914122] [2019-12-18 21:55:40,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:40,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:55:40,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863189235] [2019-12-18 21:55:40,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:55:40,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:55:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:55:40,316 INFO L87 Difference]: Start difference. First operand 741 states and 1602 transitions. Second operand 4 states. [2019-12-18 21:55:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:40,332 INFO L93 Difference]: Finished difference Result 1196 states and 2609 transitions. [2019-12-18 21:55:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:55:40,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 21:55:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:40,333 INFO L225 Difference]: With dead ends: 1196 [2019-12-18 21:55:40,333 INFO L226 Difference]: Without dead ends: 500 [2019-12-18 21:55:40,334 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-18 21:55:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-18 21:55:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-18 21:55:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-18 21:55:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1092 transitions. [2019-12-18 21:55:40,342 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1092 transitions. Word has length 52 [2019-12-18 21:55:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:40,343 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1092 transitions. [2019-12-18 21:55:40,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:55:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1092 transitions. [2019-12-18 21:55:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:55:40,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:40,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:40,345 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1967696263, now seen corresponding path program 3 times [2019-12-18 21:55:40,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:40,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075445585] [2019-12-18 21:55:40,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:40,453 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-18 21:55:40,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075445585] [2019-12-18 21:55:40,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:40,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:55:40,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633208788] [2019-12-18 21:55:40,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:55:40,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:55:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:55:40,456 INFO L87 Difference]: Start difference. First operand 500 states and 1092 transitions. Second operand 7 states. [2019-12-18 21:55:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:40,628 INFO L93 Difference]: Finished difference Result 992 states and 2078 transitions. [2019-12-18 21:55:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:55:40,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:55:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:40,630 INFO L225 Difference]: With dead ends: 992 [2019-12-18 21:55:40,630 INFO L226 Difference]: Without dead ends: 701 [2019-12-18 21:55:40,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:55:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-18 21:55:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 532. [2019-12-18 21:55:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-18 21:55:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1152 transitions. [2019-12-18 21:55:40,640 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1152 transitions. Word has length 52 [2019-12-18 21:55:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:40,641 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1152 transitions. [2019-12-18 21:55:40,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:55:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1152 transitions. [2019-12-18 21:55:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:55:40,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:40,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 21:55:40,643 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash 689321111, now seen corresponding path program 4 times [2019-12-18 21:55:40,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:40,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115783721] [2019-12-18 21:55:40,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:40,734 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-18 21:55:40,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115783721] [2019-12-18 21:55:40,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:40,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:55:40,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670773703] [2019-12-18 21:55:40,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:55:40,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:40,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:55:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:55:40,736 INFO L87 Difference]: Start difference. First operand 532 states and 1152 transitions. Second operand 5 states. [2019-12-18 21:55:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:41,109 INFO L93 Difference]: Finished difference Result 886 states and 1851 transitions. [2019-12-18 21:55:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:55:41,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 21:55:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:41,111 INFO L225 Difference]: With dead ends: 886 [2019-12-18 21:55:41,111 INFO L226 Difference]: Without dead ends: 862 [2019-12-18 21:55:41,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:55:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-12-18 21:55:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 714. [2019-12-18 21:55:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-12-18 21:55:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1537 transitions. [2019-12-18 21:55:41,125 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1537 transitions. Word has length 52 [2019-12-18 21:55:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:41,125 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1537 transitions. [2019-12-18 21:55:41,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:55:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1537 transitions. [2019-12-18 21:55:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:55:41,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:41,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:41,128 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:41,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1511703527, now seen corresponding path program 5 times [2019-12-18 21:55:41,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:41,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776511280] [2019-12-18 21:55:41,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:55:41,200 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-18 21:55:41,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776511280] [2019-12-18 21:55:41,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:55:41,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:55:41,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052668953] [2019-12-18 21:55:41,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:55:41,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:55:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:55:41,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:55:41,202 INFO L87 Difference]: Start difference. First operand 714 states and 1537 transitions. Second operand 3 states. [2019-12-18 21:55:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:55:41,255 INFO L93 Difference]: Finished difference Result 908 states and 1938 transitions. [2019-12-18 21:55:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:55:41,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:55:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:55:41,257 INFO L225 Difference]: With dead ends: 908 [2019-12-18 21:55:41,257 INFO L226 Difference]: Without dead ends: 908 [2019-12-18 21:55:41,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:55:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-18 21:55:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 743. [2019-12-18 21:55:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-18 21:55:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-18 21:55:41,270 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-18 21:55:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:55:41,270 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-18 21:55:41,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:55:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-18 21:55:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:55:41,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:55:41,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:55:41,273 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:55:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:55:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-18 21:55:41,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:55:41,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696424044] [2019-12-18 21:55:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:55:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:55:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:55:41,462 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:55:41,463 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:55:41,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1551~0.base_24|) 0) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1551~0.base_24| 4)) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1551~0.base_24|) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= 0 |v_ULTIMATE.start_main_~#t1551~0.offset_19|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1551~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1551~0.base_24|) |v_ULTIMATE.start_main_~#t1551~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1551~0.base_24| 1)) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_main_~#t1551~0.base=|v_ULTIMATE.start_main_~#t1551~0.base_24|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1552~0.offset=|v_ULTIMATE.start_main_~#t1552~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ULTIMATE.start_main_~#t1551~0.offset=|v_ULTIMATE.start_main_~#t1551~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t1552~0.base=|v_ULTIMATE.start_main_~#t1552~0.base_25|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1551~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1552~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1551~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~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, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t1552~0.base, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:55:41,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1552~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1552~0.base_13|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1552~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1552~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1552~0.base_13|) |v_ULTIMATE.start_main_~#t1552~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1552~0.base_13| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t1552~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t1552~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1552~0.offset=|v_ULTIMATE.start_main_~#t1552~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1552~0.base=|v_ULTIMATE.start_main_~#t1552~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1552~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1552~0.base] because there is no mapped edge [2019-12-18 21:55:41,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~__unbuffered_p0_EAX~0_Out138351007 ~x~0_In138351007) (= 1 ~y$r_buff0_thd1~0_Out138351007) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In138351007)) (= ~y$r_buff0_thd2~0_In138351007 ~y$r_buff1_thd2~0_Out138351007) (= ~y$r_buff0_thd1~0_In138351007 ~y$r_buff1_thd1~0_Out138351007) (= ~y$r_buff0_thd0~0_In138351007 ~y$r_buff1_thd0~0_Out138351007)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In138351007, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In138351007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In138351007, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In138351007, ~x~0=~x~0_In138351007} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out138351007, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out138351007, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out138351007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In138351007, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out138351007, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In138351007, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In138351007, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out138351007, ~x~0=~x~0_In138351007} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:55:41,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-183593260 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-183593260 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-183593260| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-183593260| ~y$w_buff0_used~0_In-183593260)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-183593260, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-183593260} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-183593260|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-183593260, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-183593260} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:55:41,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1894541401 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1894541401| ~y$w_buff0_used~0_In1894541401) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1894541401| |P1Thread1of1ForFork1_#t~ite20_Out1894541401|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1894541401| ~y$w_buff0_used~0_In1894541401) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1894541401| |P1Thread1of1ForFork1_#t~ite21_Out1894541401|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1894541401 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1894541401 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1894541401 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1894541401 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894541401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1894541401, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1894541401|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1894541401, ~weak$$choice2~0=~weak$$choice2~0_In1894541401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894541401} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1894541401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1894541401, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1894541401|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1894541401, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1894541401|, ~weak$$choice2~0=~weak$$choice2~0_In1894541401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1894541401} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:55:41,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-349957242 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-349957242 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-349957242 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In-349957242 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-349957242| |P1Thread1of1ForFork1_#t~ite23_Out-349957242|)) (.cse3 (= 0 (mod ~weak$$choice2~0_In-349957242 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse1) (= |P1Thread1of1ForFork1_#t~ite22_Out-349957242| 0) (= |P1Thread1of1ForFork1_#t~ite22_Out-349957242| |P1Thread1of1ForFork1_#t~ite23_Out-349957242|) .cse3 (not .cse4) .cse5)) (and (or (and (= ~y$w_buff1_used~0_In-349957242 |P1Thread1of1ForFork1_#t~ite23_Out-349957242|) (or (and .cse2 .cse6) (and .cse0 .cse6) .cse4) .cse3 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-349957242| ~y$w_buff1_used~0_In-349957242) (not .cse3) (= |P1Thread1of1ForFork1_#t~ite23_Out-349957242| |P1Thread1of1ForFork1_#t~ite23_In-349957242|))) (= |P1Thread1of1ForFork1_#t~ite22_In-349957242| |P1Thread1of1ForFork1_#t~ite22_Out-349957242|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-349957242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-349957242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-349957242, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-349957242|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-349957242|, ~weak$$choice2~0=~weak$$choice2~0_In-349957242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-349957242} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-349957242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-349957242, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-349957242, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-349957242|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-349957242|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-349957242|, ~weak$$choice2~0=~weak$$choice2~0_In-349957242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-349957242} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 21:55:41,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:55:41,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1353431202 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1353431202 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1353431202 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1353431202 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1353431202|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1353431202| ~y$w_buff1_used~0_In-1353431202) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1353431202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353431202, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1353431202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353431202} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1353431202|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1353431202, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353431202, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1353431202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353431202} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:55:41,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In507659792 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In507659792 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out507659792 ~y$r_buff0_thd1~0_In507659792)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out507659792)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In507659792, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In507659792} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In507659792, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out507659792|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out507659792} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:55:41,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-873742233 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-873742233 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In-873742233 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite30_Out-873742233| |P1Thread1of1ForFork1_#t~ite29_Out-873742233|)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-873742233 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-873742233 256) 0))) (or (and (or (and (= ~y$r_buff1_thd2~0_In-873742233 |P1Thread1of1ForFork1_#t~ite30_Out-873742233|) (= |P1Thread1of1ForFork1_#t~ite29_In-873742233| |P1Thread1of1ForFork1_#t~ite29_Out-873742233|) (not .cse0)) (and .cse0 (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) .cse5 (= ~y$r_buff1_thd2~0_In-873742233 |P1Thread1of1ForFork1_#t~ite29_Out-873742233|))) (= |P1Thread1of1ForFork1_#t~ite28_In-873742233| |P1Thread1of1ForFork1_#t~ite28_Out-873742233|)) (let ((.cse6 (not .cse2))) (and .cse0 (or .cse6 (not .cse1)) (not .cse4) .cse5 (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork1_#t~ite28_Out-873742233| 0) (= |P1Thread1of1ForFork1_#t~ite28_Out-873742233| |P1Thread1of1ForFork1_#t~ite29_Out-873742233|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-873742233, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-873742233|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-873742233, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-873742233, ~weak$$choice2~0=~weak$$choice2~0_In-873742233, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-873742233|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-873742233} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-873742233, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-873742233|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-873742233|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-873742233, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-873742233, ~weak$$choice2~0=~weak$$choice2~0_In-873742233, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-873742233|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-873742233} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:55:41,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-400876587 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-400876587 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-400876587 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-400876587 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-400876587| ~y$r_buff1_thd1~0_In-400876587)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-400876587| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-400876587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-400876587, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-400876587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-400876587} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-400876587, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-400876587, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-400876587|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-400876587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-400876587} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:55:41,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 21:55:41,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In84171378 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In84171378 256) 0))) (or (and (= ~y~0_In84171378 |P1Thread1of1ForFork1_#t~ite32_Out84171378|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In84171378 |P1Thread1of1ForFork1_#t~ite32_Out84171378|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In84171378, ~y$w_buff1~0=~y$w_buff1~0_In84171378, ~y~0=~y~0_In84171378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84171378} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In84171378, ~y$w_buff1~0=~y$w_buff1~0_In84171378, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out84171378|, ~y~0=~y~0_In84171378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84171378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 21:55:41,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 21:55:41,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-151066531 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-151066531 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-151066531| ~y$w_buff0_used~0_In-151066531) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-151066531| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-151066531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-151066531} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-151066531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-151066531, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-151066531|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:55:41,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In116650987 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In116650987 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In116650987 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In116650987 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out116650987| ~y$w_buff1_used~0_In116650987) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out116650987| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In116650987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In116650987, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In116650987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In116650987} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In116650987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In116650987, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In116650987, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out116650987|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In116650987} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:55:41,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-839368979 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-839368979 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-839368979| ~y$r_buff0_thd2~0_In-839368979)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-839368979| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-839368979, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-839368979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-839368979, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-839368979, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-839368979|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:55:41,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In622918998 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In622918998 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In622918998 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In622918998 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out622918998| 0)) (and (= ~y$r_buff1_thd2~0_In622918998 |P1Thread1of1ForFork1_#t~ite37_Out622918998|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In622918998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In622918998, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In622918998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In622918998} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In622918998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In622918998, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In622918998, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out622918998|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In622918998} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:55:41,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:55:41,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:55:41,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:55:41,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1696902866 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1696902866 256) 0))) (or (and (= ~y~0_In-1696902866 |ULTIMATE.start_main_#t~ite40_Out-1696902866|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In-1696902866 |ULTIMATE.start_main_#t~ite40_Out-1696902866|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1696902866, ~y~0=~y~0_In-1696902866, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1696902866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1696902866} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1696902866|, ~y$w_buff1~0=~y$w_buff1~0_In-1696902866, ~y~0=~y~0_In-1696902866, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1696902866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1696902866} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:55:41,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 21:55:41,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1649158681 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1649158681 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out1649158681|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1649158681 |ULTIMATE.start_main_#t~ite42_Out1649158681|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1649158681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1649158681} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1649158681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1649158681, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1649158681|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:55:41,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-101834270 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-101834270 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-101834270 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-101834270 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-101834270| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-101834270| ~y$w_buff1_used~0_In-101834270) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-101834270, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101834270, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101834270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101834270} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-101834270, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101834270, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-101834270|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101834270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101834270} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:55:41,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1737924996 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1737924996 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1737924996| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1737924996| ~y$r_buff0_thd0~0_In1737924996)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1737924996, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1737924996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1737924996, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1737924996, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1737924996|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:55:41,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In260064557 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In260064557 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In260064557 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In260064557 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out260064557|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In260064557 |ULTIMATE.start_main_#t~ite45_Out260064557|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In260064557, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In260064557, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In260064557, ~y$w_buff1_used~0=~y$w_buff1_used~0_In260064557} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In260064557, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In260064557, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In260064557, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out260064557|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In260064557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:55:41,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:55:41,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:55:41 BasicIcfg [2019-12-18 21:55:41,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:55:41,573 INFO L168 Benchmark]: Toolchain (without parser) took 13167.21 ms. Allocated memory was 146.8 MB in the beginning and 566.8 MB in the end (delta: 420.0 MB). Free memory was 103.6 MB in the beginning and 198.6 MB in the end (delta: -95.0 MB). Peak memory consumption was 324.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,574 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.68 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 103.2 MB in the beginning and 156.7 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.64 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,576 INFO L168 Benchmark]: Boogie Preprocessor took 41.92 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,577 INFO L168 Benchmark]: RCFGBuilder took 780.34 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 108.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,578 INFO L168 Benchmark]: TraceAbstraction took 11553.15 ms. Allocated memory was 202.4 MB in the beginning and 566.8 MB in the end (delta: 364.4 MB). Free memory was 107.5 MB in the beginning and 198.6 MB in the end (delta: -91.1 MB). Peak memory consumption was 273.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:55:41,582 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 727.68 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 103.2 MB in the beginning and 156.7 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.64 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.92 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.34 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 108.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11553.15 ms. Allocated memory was 202.4 MB in the beginning and 566.8 MB in the end (delta: 364.4 MB). Free memory was 107.5 MB in the beginning and 198.6 MB in the end (delta: -91.1 MB). Peak memory consumption was 273.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1551, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1552, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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=0, __unbuffered_p1_EAX=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=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] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L738] 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) [L759] 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) [L760] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L760] 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)) [L761] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L761] 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)) [L762] 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)) [L763] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1470 SDtfs, 1647 SDslu, 2991 SDs, 0 SdLazy, 1315 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 6351 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 41838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...