/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:14:44,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:14:44,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:14:44,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:14:44,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:14:44,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:14:44,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:14:44,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:14:44,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:14:44,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:14:44,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:14:44,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:14:44,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:14:44,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:14:44,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:14:44,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:14:44,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:14:44,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:14:44,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:14:44,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:14:44,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:14:44,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:14:44,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:14:44,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:14:44,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:14:44,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:14:44,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:14:44,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:14:44,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:14:44,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:14:44,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:14:44,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:14:44,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:14:44,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:14:44,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:14:44,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:14:44,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:14:44,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:14:44,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:14:44,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:14:44,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:14:44,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:14:44,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:14:44,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:14:44,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:14:44,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:14:44,302 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:14:44,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:14:44,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:14:44,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:14:44,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:14:44,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:14:44,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:14:44,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:14:44,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:14:44,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:14:44,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:14:44,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:14:44,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:14:44,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:14:44,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:14:44,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:14:44,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:14:44,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:14:44,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:14:44,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:14:44,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:14:44,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:14:44,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:14:44,310 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:14:44,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:14:44,310 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:14:44,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:14:44,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:14:44,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:14:44,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:14:44,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:14:44,631 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:14:44,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-27 17:14:44,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f684854cb/4981e3c514904b9b86273c0ddd5c93ab/FLAGe049c22c1 [2019-12-27 17:14:45,269 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:14:45,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_rmo.oepc.i [2019-12-27 17:14:45,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f684854cb/4981e3c514904b9b86273c0ddd5c93ab/FLAGe049c22c1 [2019-12-27 17:14:45,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f684854cb/4981e3c514904b9b86273c0ddd5c93ab [2019-12-27 17:14:45,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:14:45,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:14:45,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:45,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:14:45,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:14:45,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:45" (1/1) ... [2019-12-27 17:14:45,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:45, skipping insertion in model container [2019-12-27 17:14:45,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:45" (1/1) ... [2019-12-27 17:14:45,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:14:45,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:14:46,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:46,155 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:14:46,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:46,287 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:14:46,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46 WrapperNode [2019-12-27 17:14:46,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:46,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:46,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:14:46,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:14:46,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:46,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:14:46,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:14:46,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:14:46,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... [2019-12-27 17:14:46,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:14:46,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:14:46,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:14:46,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:14:46,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:14:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:14:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:14:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:14:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:14:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:14:46,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:14:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:14:46,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:14:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:14:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:14:46,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:14:46,466 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:14:47,143 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:14:47,143 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:14:47,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:47 BoogieIcfgContainer [2019-12-27 17:14:47,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:14:47,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:14:47,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:14:47,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:14:47,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:14:45" (1/3) ... [2019-12-27 17:14:47,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411daec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:47, skipping insertion in model container [2019-12-27 17:14:47,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:46" (2/3) ... [2019-12-27 17:14:47,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411daec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:47, skipping insertion in model container [2019-12-27 17:14:47,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:47" (3/3) ... [2019-12-27 17:14:47,155 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_rmo.oepc.i [2019-12-27 17:14:47,165 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:14:47,166 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:14:47,173 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:14:47,174 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:14:47,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:47,303 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:14:47,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:14:47,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:14:47,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:14:47,328 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:14:47,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:14:47,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:14:47,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:14:47,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:14:47,352 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:14:47,354 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:47,465 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:47,466 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:47,480 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. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:47,499 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:47,543 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:47,544 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:47,550 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. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:47,564 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:14:47,565 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:14:52,324 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:14:52,430 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:14:52,578 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 17:14:52,578 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 17:14:52,584 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 17:14:53,030 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 17:14:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 17:14:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:14:53,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:53,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:14:53,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 17:14:53,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:53,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750882041] [2019-12-27 17:14:53,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:53,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750882041] [2019-12-27 17:14:53,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:53,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:14:53,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2707373] [2019-12-27 17:14:53,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:53,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:53,291 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:14:53,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:53,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:53,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:14:53,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:14:53,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:53,313 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 17:14:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:53,543 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 17:14:53,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:14:53,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:14:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:53,622 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 17:14:53,622 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 17:14:53,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 17:14:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 17:14:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 17:14:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 17:14:54,058 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 17:14:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:54,059 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 17:14:54,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:14:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 17:14:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:14:54,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:54,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:54,063 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 17:14:54,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:54,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486722478] [2019-12-27 17:14:54,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:54,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486722478] [2019-12-27 17:14:54,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:54,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:54,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129152194] [2019-12-27 17:14:54,207 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:54,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:54,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:14:54,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:54,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:54,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:54,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:54,215 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 17:14:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:54,614 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 17:14:54,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:14:54,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:14:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:54,714 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 17:14:54,714 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 17:14:54,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 17:14:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 17:14:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 17:14:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 17:14:55,181 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 17:14:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:55,181 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 17:14:55,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 17:14:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:14:55,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:55,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:55,188 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 17:14:55,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:55,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745820209] [2019-12-27 17:14:55,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:55,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745820209] [2019-12-27 17:14:55,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:55,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:55,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972599138] [2019-12-27 17:14:55,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:55,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:55,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:14:55,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:55,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:55,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:14:55,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:55,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:14:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:55,281 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 17:14:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:55,658 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 17:14:55,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:14:55,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:14:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:55,707 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 17:14:55,707 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 17:14:55,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:14:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 17:14:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 17:14:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 17:14:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 17:14:56,802 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 17:14:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:56,803 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 17:14:56,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:14:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 17:14:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:14:56,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:56,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:56,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:56,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 17:14:56,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:56,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462290674] [2019-12-27 17:14:56,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:56,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462290674] [2019-12-27 17:14:56,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:56,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:56,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134621184] [2019-12-27 17:14:56,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:56,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:56,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 17:14:56,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:56,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:14:56,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:56,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:56,924 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 4 states. [2019-12-27 17:14:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:56,969 INFO L93 Difference]: Finished difference Result 2200 states and 5503 transitions. [2019-12-27 17:14:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:14:56,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:14:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:56,974 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 17:14:56,974 INFO L226 Difference]: Without dead ends: 1563 [2019-12-27 17:14:56,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-27 17:14:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1547. [2019-12-27 17:14:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-27 17:14:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-27 17:14:57,006 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 16 [2019-12-27 17:14:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:57,006 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-27 17:14:57,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-27 17:14:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 17:14:57,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:57,009 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] [2019-12-27 17:14:57,009 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 17:14:57,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:57,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323608341] [2019-12-27 17:14:57,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:57,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323608341] [2019-12-27 17:14:57,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:57,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:14:57,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943766950] [2019-12-27 17:14:57,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:57,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:57,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 17:14:57,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:57,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:57,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:14:57,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:57,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:14:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:14:57,179 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-27 17:14:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:57,666 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-27 17:14:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:14:57,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 17:14:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:57,673 INFO L225 Difference]: With dead ends: 2337 [2019-12-27 17:14:57,673 INFO L226 Difference]: Without dead ends: 2285 [2019-12-27 17:14:57,673 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-27 17:14:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-27 17:14:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-27 17:14:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-27 17:14:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-27 17:14:57,708 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-27 17:14:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:57,709 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-27 17:14:57,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:14:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-27 17:14:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:14:57,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:57,711 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] [2019-12-27 17:14:57,711 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-27 17:14:57,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:57,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958149349] [2019-12-27 17:14:57,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:57,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958149349] [2019-12-27 17:14:57,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:57,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:14:57,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2042165354] [2019-12-27 17:14:57,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:57,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:57,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 17:14:57,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:58,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:14:58,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:14:58,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:14:58,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:14:58,035 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 8 states. [2019-12-27 17:14:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:58,863 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-27 17:14:58,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:14:58,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-27 17:14:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:58,868 INFO L225 Difference]: With dead ends: 2383 [2019-12-27 17:14:58,869 INFO L226 Difference]: Without dead ends: 2383 [2019-12-27 17:14:58,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:14:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-27 17:14:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-27 17:14:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-27 17:14:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-27 17:14:58,907 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-27 17:14:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:58,908 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-27 17:14:58,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:14:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-27 17:14:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:14:58,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:58,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:58,912 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-27 17:14:58,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:58,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604601039] [2019-12-27 17:14:58,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:59,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604601039] [2019-12-27 17:14:59,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:59,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:14:59,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381679105] [2019-12-27 17:14:59,001 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:59,006 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:59,015 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 17:14:59,015 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:59,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:14:59,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:14:59,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:14:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:14:59,037 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 6 states. [2019-12-27 17:14:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:59,091 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-27 17:14:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:14:59,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:14:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:59,094 INFO L225 Difference]: With dead ends: 1286 [2019-12-27 17:14:59,094 INFO L226 Difference]: Without dead ends: 1165 [2019-12-27 17:14:59,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:14:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-27 17:14:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-27 17:14:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-27 17:14:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-27 17:14:59,115 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-27 17:14:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:59,116 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-27 17:14:59,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:14:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-27 17:14:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:14:59,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:59,119 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] [2019-12-27 17:14:59,119 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-27 17:14:59,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:59,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418310142] [2019-12-27 17:14:59,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:59,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418310142] [2019-12-27 17:14:59,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:59,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:59,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368577684] [2019-12-27 17:14:59,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:59,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:59,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 101 transitions. [2019-12-27 17:14:59,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:59,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:14:59,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:59,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:59,275 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 4 states. [2019-12-27 17:14:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:59,299 INFO L93 Difference]: Finished difference Result 1807 states and 3865 transitions. [2019-12-27 17:14:59,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:14:59,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-27 17:14:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:59,302 INFO L225 Difference]: With dead ends: 1807 [2019-12-27 17:14:59,302 INFO L226 Difference]: Without dead ends: 800 [2019-12-27 17:14:59,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-27 17:14:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-27 17:14:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 17:14:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-27 17:14:59,316 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 50 [2019-12-27 17:14:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:59,317 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-27 17:14:59,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-27 17:14:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:14:59,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:59,319 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] [2019-12-27 17:14:59,319 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 2 times [2019-12-27 17:14:59,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:59,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731858545] [2019-12-27 17:14:59,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:59,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731858545] [2019-12-27 17:14:59,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:59,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:14:59,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461394710] [2019-12-27 17:14:59,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:59,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:59,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 110 transitions. [2019-12-27 17:14:59,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:59,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:14:59,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:14:59,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:14:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:14:59,603 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 9 states. [2019-12-27 17:14:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:59,899 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-27 17:14:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:14:59,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 17:14:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:59,902 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 17:14:59,902 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 17:14:59,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:14:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 17:14:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-27 17:14:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-27 17:14:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-27 17:14:59,919 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-27 17:14:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:59,919 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-27 17:14:59,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:14:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-27 17:14:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 17:14:59,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:59,922 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] [2019-12-27 17:14:59,922 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:59,922 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 3 times [2019-12-27 17:14:59,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:59,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377237442] [2019-12-27 17:14:59,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:59,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377237442] [2019-12-27 17:14:59,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:59,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:59,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119842088] [2019-12-27 17:14:59,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:00,014 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:00,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 112 transitions. [2019-12-27 17:15:00,073 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:00,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:00,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:00,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:00,075 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-27 17:15:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:00,126 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-27 17:15:00,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:00,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 17:15:00,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:00,128 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 17:15:00,129 INFO L226 Difference]: Without dead ends: 1051 [2019-12-27 17:15:00,129 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-27 17:15:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-27 17:15:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-27 17:15:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 17:15:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-27 17:15:00,145 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-27 17:15:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:00,145 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-27 17:15:00,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-27 17:15:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:00,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:00,148 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] [2019-12-27 17:15:00,149 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:00,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-27 17:15:00,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:00,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017567906] [2019-12-27 17:15:00,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:00,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-27 17:15:00,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017567906] [2019-12-27 17:15:00,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:00,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:15:00,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136064721] [2019-12-27 17:15:00,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:00,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:00,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 99 transitions. [2019-12-27 17:15:00,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:00,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:15:00,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:15:00,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:15:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:15:00,475 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 7 states. [2019-12-27 17:15:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:01,070 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-27 17:15:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:15:01,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 17:15:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:01,073 INFO L225 Difference]: With dead ends: 1004 [2019-12-27 17:15:01,073 INFO L226 Difference]: Without dead ends: 1004 [2019-12-27 17:15:01,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:15:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-27 17:15:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-27 17:15:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 17:15:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-27 17:15:01,088 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-27 17:15:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:01,089 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-27 17:15:01,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:15:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-27 17:15:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:15:01,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:01,091 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] [2019-12-27 17:15:01,092 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-27 17:15:01,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:01,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528150142] [2019-12-27 17:15:01,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:15:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:15:01,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528150142] [2019-12-27 17:15:01,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:15:01,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:15:01,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [631030413] [2019-12-27 17:15:01,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:15:01,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:15:01,243 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 17:15:01,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:15:01,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:15:01,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:15:01,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:15:01,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:15:01,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:01,245 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-27 17:15:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:15:01,258 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-27 17:15:01,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:15:01,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 17:15:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:15:01,260 INFO L225 Difference]: With dead ends: 908 [2019-12-27 17:15:01,260 INFO L226 Difference]: Without dead ends: 908 [2019-12-27 17:15:01,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:15:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-27 17:15:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-27 17:15:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 17:15:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 17:15:01,275 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 17:15:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:15:01,275 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 17:15:01,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:15:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 17:15:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:15:01,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:15:01,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:15:01,278 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:15:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:15:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 17:15:01,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:15:01,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106795264] [2019-12-27 17:15:01,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:15:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:15:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:15:01,494 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:15:01,495 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:15:01,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_40| 1)) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1289~0.base_40| 4)) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t1289~0.offset_27|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1289~0.base_40|) |v_ULTIMATE.start_main_~#t1289~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1289~0.base_40|) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1289~0.base_40|)) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #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_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t1289~0.offset=|v_ULTIMATE.start_main_~#t1289~0.offset_27|, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1289~0.base=|v_ULTIMATE.start_main_~#t1289~0.base_40|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} 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, ULTIMATE.start_main_~#t1289~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1289~0.base, ~y~0, ULTIMATE.start_main_~#t1290~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~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, ULTIMATE.start_main_~#t1290~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:15:01,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1290~0.base_13|) |v_ULTIMATE.start_main_~#t1290~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1290~0.base_13|) (= |v_ULTIMATE.start_main_~#t1290~0.offset_11| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1290~0.base_13| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1290~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1290~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1290~0.base=|v_ULTIMATE.start_main_~#t1290~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1290~0.offset=|v_ULTIMATE.start_main_~#t1290~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1290~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1290~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 17:15:01,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-622459172 ~y$r_buff0_thd2~0_In-622459172) (= ~y$r_buff1_thd1~0_Out-622459172 ~y$r_buff0_thd1~0_In-622459172) (= 1 ~y$r_buff0_thd1~0_Out-622459172) (= ~y$r_buff1_thd0~0_Out-622459172 ~y$r_buff0_thd0~0_In-622459172) (= ~x~0_In-622459172 ~__unbuffered_p0_EAX~0_Out-622459172) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-622459172))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622459172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-622459172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-622459172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-622459172, ~x~0=~x~0_In-622459172} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-622459172, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-622459172, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-622459172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-622459172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-622459172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-622459172, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-622459172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-622459172, ~x~0=~x~0_In-622459172} 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-27 17:15:01,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1531950247 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1531950247 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1531950247|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1531950247 |P0Thread1of1ForFork0_#t~ite5_Out-1531950247|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531950247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1531950247} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1531950247|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531950247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1531950247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:15:01,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2004607668 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-2004607668| |P1Thread1of1ForFork1_#t~ite20_Out-2004607668|) (= |P1Thread1of1ForFork1_#t~ite20_Out-2004607668| ~y$w_buff0_used~0_In-2004607668) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2004607668 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-2004607668 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2004607668 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-2004607668 256)) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-2004607668| ~y$w_buff0_used~0_In-2004607668) (= |P1Thread1of1ForFork1_#t~ite20_In-2004607668| |P1Thread1of1ForFork1_#t~ite20_Out-2004607668|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2004607668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004607668, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2004607668|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004607668, ~weak$$choice2~0=~weak$$choice2~0_In-2004607668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2004607668} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2004607668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004607668, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2004607668|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004607668, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2004607668|, ~weak$$choice2~0=~weak$$choice2~0_In-2004607668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2004607668} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:15:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1714968535 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1714968535 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1714968535 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out1714968535| |P1Thread1of1ForFork1_#t~ite24_Out1714968535|)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In1714968535 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1714968535 256) 0))) (or (and (or (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2)) (= |P1Thread1of1ForFork1_#t~ite23_Out1714968535| ~y$w_buff1_used~0_In1714968535) .cse5) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out1714968535| ~y$w_buff1_used~0_In1714968535) (= |P1Thread1of1ForFork1_#t~ite23_Out1714968535| |P1Thread1of1ForFork1_#t~ite23_In1714968535|))) (= |P1Thread1of1ForFork1_#t~ite22_In1714968535| |P1Thread1of1ForFork1_#t~ite22_Out1714968535|)) (let ((.cse6 (not .cse2))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite22_Out1714968535| |P1Thread1of1ForFork1_#t~ite23_Out1714968535|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite22_Out1714968535| 0) (or (not .cse3) .cse6) .cse5 (or .cse6 (not .cse4)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1714968535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1714968535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1714968535, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1714968535|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1714968535|, ~weak$$choice2~0=~weak$$choice2~0_In1714968535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714968535} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1714968535, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1714968535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1714968535, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1714968535|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1714968535|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1714968535|, ~weak$$choice2~0=~weak$$choice2~0_In1714968535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714968535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 17:15:01,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In1093097152 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1093097152 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1093097152 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1093097152 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1093097152| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out1093097152| ~y$w_buff1_used~0_In1093097152)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1093097152, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1093097152, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1093097152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1093097152} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1093097152|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1093097152, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1093097152, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1093097152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1093097152} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:15:01,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-543292647 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-543292647 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-543292647 ~y$r_buff0_thd1~0_In-543292647)) (and (= ~y$r_buff0_thd1~0_Out-543292647 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-543292647, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-543292647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-543292647, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-543292647|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-543292647} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:15:01,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-641270823 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-641270823 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-641270823 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-641270823 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-641270823| ~y$r_buff1_thd1~0_In-641270823) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-641270823| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-641270823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-641270823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-641270823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641270823} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-641270823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-641270823, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-641270823|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-641270823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641270823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:15:01,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:15:01,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-259968805 256)))) (or (and (= ~y$r_buff1_thd2~0_In-259968805 |P1Thread1of1ForFork1_#t~ite29_Out-259968805|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-259968805 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-259968805 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-259968805 256))) (= (mod ~y$w_buff0_used~0_In-259968805 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out-259968805| |P1Thread1of1ForFork1_#t~ite29_Out-259968805|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-259968805| |P1Thread1of1ForFork1_#t~ite29_Out-259968805|) (not .cse1) (= ~y$r_buff1_thd2~0_In-259968805 |P1Thread1of1ForFork1_#t~ite30_Out-259968805|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-259968805, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-259968805|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-259968805, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-259968805, ~weak$$choice2~0=~weak$$choice2~0_In-259968805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-259968805} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-259968805, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-259968805|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-259968805|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-259968805, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-259968805, ~weak$$choice2~0=~weak$$choice2~0_In-259968805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-259968805} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:15:01,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 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_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 17:15:01,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-145218015 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-145218015 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-145218015| ~y~0_In-145218015)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-145218015| ~y$w_buff1~0_In-145218015)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-145218015, ~y$w_buff1~0=~y$w_buff1~0_In-145218015, ~y~0=~y~0_In-145218015, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-145218015} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-145218015, ~y$w_buff1~0=~y$w_buff1~0_In-145218015, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-145218015|, ~y~0=~y~0_In-145218015, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-145218015} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:15:01,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 17:15:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1486968704 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1486968704 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1486968704| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1486968704| ~y$w_buff0_used~0_In-1486968704) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486968704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1486968704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486968704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1486968704, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1486968704|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:15:01,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1368966771 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1368966771 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1368966771 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1368966771 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1368966771|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1368966771 |P1Thread1of1ForFork1_#t~ite35_Out1368966771|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1368966771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1368966771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1368966771, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1368966771} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1368966771, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1368966771, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1368966771, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1368966771|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1368966771} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:15:01,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In410199478 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In410199478 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In410199478 |P1Thread1of1ForFork1_#t~ite36_Out410199478|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out410199478| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In410199478, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In410199478} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In410199478, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In410199478, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out410199478|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:15:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In194357446 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In194357446 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In194357446 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In194357446 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In194357446 |P1Thread1of1ForFork1_#t~ite37_Out194357446|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out194357446|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In194357446, ~y$w_buff0_used~0=~y$w_buff0_used~0_In194357446, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In194357446, ~y$w_buff1_used~0=~y$w_buff1_used~0_In194357446} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In194357446, ~y$w_buff0_used~0=~y$w_buff0_used~0_In194357446, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In194357446, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out194357446|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In194357446} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:15:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} 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-27 17:15:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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-27 17:15:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:15:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1992061363 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1992061363 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1992061363 |ULTIMATE.start_main_#t~ite40_Out-1992061363|)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1992061363| ~y$w_buff1~0_In-1992061363) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1992061363, ~y~0=~y~0_In-1992061363, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1992061363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1992061363} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1992061363|, ~y$w_buff1~0=~y$w_buff1~0_In-1992061363, ~y~0=~y~0_In-1992061363, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1992061363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1992061363} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:15:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 17:15:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1547541684 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1547541684 256) 0))) (or (and (= ~y$w_buff0_used~0_In1547541684 |ULTIMATE.start_main_#t~ite42_Out1547541684|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1547541684|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1547541684, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547541684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1547541684, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547541684, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1547541684|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:15:01,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1591954590 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1591954590 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1591954590 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1591954590 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1591954590|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1591954590 |ULTIMATE.start_main_#t~ite43_Out1591954590|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1591954590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591954590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1591954590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591954590} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1591954590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591954590, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1591954590|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1591954590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591954590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:15:01,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-970624798 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-970624798 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-970624798|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-970624798 |ULTIMATE.start_main_#t~ite44_Out-970624798|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-970624798} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-970624798, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-970624798|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:15:01,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-824636522 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-824636522 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-824636522 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-824636522 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-824636522| ~y$r_buff1_thd0~0_In-824636522) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-824636522| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-824636522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-824636522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-824636522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-824636522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-824636522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-824636522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-824636522, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-824636522|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-824636522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:15:01,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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-27 17:15:01,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:15:01 BasicIcfg [2019-12-27 17:15:01,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:15:01,628 INFO L168 Benchmark]: Toolchain (without parser) took 16073.22 ms. Allocated memory was 138.9 MB in the beginning and 701.0 MB in the end (delta: 562.0 MB). Free memory was 101.7 MB in the beginning and 308.5 MB in the end (delta: -206.8 MB). Peak memory consumption was 355.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:01,629 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:15:01,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.28 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 156.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:01,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.33 ms. Allocated memory is still 203.9 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-27 17:15:01,631 INFO L168 Benchmark]: Boogie Preprocessor took 38.39 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:01,632 INFO L168 Benchmark]: RCFGBuilder took 755.40 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 107.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:01,633 INFO L168 Benchmark]: TraceAbstraction took 14479.14 ms. Allocated memory was 203.9 MB in the beginning and 701.0 MB in the end (delta: 497.0 MB). Free memory was 107.0 MB in the beginning and 308.5 MB in the end (delta: -201.5 MB). Peak memory consumption was 295.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:15:01,637 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.28 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.5 MB in the beginning and 156.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.33 ms. Allocated memory is still 203.9 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 38.39 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 755.40 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 107.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14479.14 ms. Allocated memory was 203.9 MB in the beginning and 701.0 MB in the end (delta: 497.0 MB). Free memory was 107.0 MB in the beginning and 308.5 MB in the end (delta: -201.5 MB). Peak memory consumption was 295.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 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(&t1289, ((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(&t1290, ((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)) [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: 14.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1504 SDtfs, 1612 SDslu, 3374 SDs, 0 SdLazy, 2109 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 5973 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 41543 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...