/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:15:07,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:15:07,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:15:07,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:15:07,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:15:07,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:15:07,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:15:07,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:15:07,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:15:07,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:15:07,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:15:07,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:15:07,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:15:07,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:15:07,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:15:07,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:15:07,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:15:07,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:15:07,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:15:07,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:15:07,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:15:07,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:15:07,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:15:07,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:15:07,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:15:07,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:15:07,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:15:07,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:15:07,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:15:07,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:15:07,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:15:07,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:15:07,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:15:07,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:15:07,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:15:07,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:15:07,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:15:07,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:15:07,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:15:07,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:15:07,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:15:07,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:15:07,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:15:07,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:15:07,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:15:07,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:15:07,267 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:15:07,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:15:07,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:15:07,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:15:07,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:15:07,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:15:07,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:15:07,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:15:07,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:15:07,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:15:07,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:15:07,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:15:07,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:15:07,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:15:07,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:15:07,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:15:07,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:15:07,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:15:07,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:15:07,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:15:07,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:15:07,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:15:07,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:15:07,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:15:07,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:15:07,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:15:07,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:15:07,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:15:07,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:15:07,567 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:15:07,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-27 03:15:07,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f4b091d/e2b9f44ffaed43279a3c44c3d39ec058/FLAGac9469031 [2019-12-27 03:15:08,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:15:08,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-27 03:15:08,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f4b091d/e2b9f44ffaed43279a3c44c3d39ec058/FLAGac9469031 [2019-12-27 03:15:08,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f4b091d/e2b9f44ffaed43279a3c44c3d39ec058 [2019-12-27 03:15:08,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:15:08,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:15:08,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:15:08,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:15:08,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:15:08,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:15:08" (1/1) ... [2019-12-27 03:15:08,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca89893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:08, skipping insertion in model container [2019-12-27 03:15:08,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:15:08" (1/1) ... [2019-12-27 03:15:08,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:15:08,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:15:09,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:15:09,119 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:15:09,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:15:09,271 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:15:09,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09 WrapperNode [2019-12-27 03:15:09,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:15:09,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:15:09,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:15:09,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:15:09,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:15:09,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:15:09,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:15:09,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:15:09,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (1/1) ... [2019-12-27 03:15:09,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:15:09,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:15:09,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:15:09,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:15:09,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (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 03:15:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:15:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:15:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:15:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:15:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:15:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:15:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:15:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:15:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:15:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:15:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:15:09,468 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 03:15:10,222 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:15:10,223 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:15:10,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:15:10 BoogieIcfgContainer [2019-12-27 03:15:10,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:15:10,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:15:10,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:15:10,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:15:10,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:15:08" (1/3) ... [2019-12-27 03:15:10,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7108406c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:15:10, skipping insertion in model container [2019-12-27 03:15:10,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:09" (2/3) ... [2019-12-27 03:15:10,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7108406c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:15:10, skipping insertion in model container [2019-12-27 03:15:10,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:15:10" (3/3) ... [2019-12-27 03:15:10,234 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-12-27 03:15:10,244 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:15:10,245 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:15:10,253 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:15:10,254 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:15:10,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,292 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,293 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,293 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:10,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:15:10,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:15:10,400 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:15:10,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:15:10,401 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:15:10,401 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:15:10,401 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:15:10,401 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:15:10,401 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:15:10,419 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 03:15:10,421 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:15:10,513 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:15:10,513 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:15:10,530 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 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:15:10,553 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:15:10,599 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:15:10,600 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:15:10,606 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 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:15:10,621 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 03:15:10,623 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:15:15,414 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 03:15:15,541 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 03:15:15,884 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-27 03:15:15,884 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 03:15:15,888 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 03:15:16,640 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-27 03:15:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-27 03:15:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:15:16,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:16,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:15:16,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-27 03:15:16,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:16,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105222859] [2019-12-27 03:15:16,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:16,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105222859] [2019-12-27 03:15:16,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:16,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:15:16,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260246469] [2019-12-27 03:15:16,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:16,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:16,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:16,901 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-27 03:15:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:17,166 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-27 03:15:17,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:17,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:15:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:17,297 INFO L225 Difference]: With dead ends: 9266 [2019-12-27 03:15:17,297 INFO L226 Difference]: Without dead ends: 8258 [2019-12-27 03:15:17,299 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 03:15:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-27 03:15:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-27 03:15:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-27 03:15:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-27 03:15:17,844 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-27 03:15:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:17,844 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-27 03:15:17,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-27 03:15:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:15:17,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:17,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:17,851 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-27 03:15:17,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:17,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192602938] [2019-12-27 03:15:17,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:18,028 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 03:15:18,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192602938] [2019-12-27 03:15:18,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:18,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:18,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969009712] [2019-12-27 03:15:18,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:15:18,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:18,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:15:18,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:15:18,032 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-27 03:15:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:18,442 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-27 03:15:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:15:18,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:15:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:18,527 INFO L225 Difference]: With dead ends: 12603 [2019-12-27 03:15:18,527 INFO L226 Difference]: Without dead ends: 12589 [2019-12-27 03:15:18,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:15:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-27 03:15:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-27 03:15:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-27 03:15:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-27 03:15:18,948 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-27 03:15:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:18,949 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-27 03:15:18,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:15:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-27 03:15:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:15:18,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:18,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:18,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-27 03:15:18,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:18,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410265088] [2019-12-27 03:15:18,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:19,065 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 03:15:19,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410265088] [2019-12-27 03:15:19,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:19,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:19,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016962919] [2019-12-27 03:15:19,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:15:19,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:15:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:15:19,069 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-27 03:15:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:19,820 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-27 03:15:19,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:15:19,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:15:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:19,867 INFO L225 Difference]: With dead ends: 13736 [2019-12-27 03:15:19,868 INFO L226 Difference]: Without dead ends: 13736 [2019-12-27 03:15:19,868 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 03:15:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-27 03:15:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-27 03:15:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-27 03:15:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-27 03:15:20,272 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-27 03:15:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:20,274 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-27 03:15:20,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:15:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-27 03:15:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:15:20,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:20,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:20,279 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-27 03:15:20,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:20,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233778635] [2019-12-27 03:15:20,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:20,374 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 03:15:20,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233778635] [2019-12-27 03:15:20,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:20,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:15:20,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532741686] [2019-12-27 03:15:20,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:20,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:20,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:20,376 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-27 03:15:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:20,560 INFO L93 Difference]: Finished difference Result 12209 states and 38285 transitions. [2019-12-27 03:15:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:20,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:15:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:20,598 INFO L225 Difference]: With dead ends: 12209 [2019-12-27 03:15:20,598 INFO L226 Difference]: Without dead ends: 12209 [2019-12-27 03:15:20,599 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 03:15:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2019-12-27 03:15:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 12209. [2019-12-27 03:15:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-27 03:15:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 38285 transitions. [2019-12-27 03:15:20,938 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 38285 transitions. Word has length 16 [2019-12-27 03:15:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:20,939 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 38285 transitions. [2019-12-27 03:15:20,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 38285 transitions. [2019-12-27 03:15:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:15:20,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:20,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:20,945 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:20,945 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-27 03:15:20,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:20,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277321183] [2019-12-27 03:15:20,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:21,002 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 03:15:21,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277321183] [2019-12-27 03:15:21,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:21,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:21,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246245258] [2019-12-27 03:15:21,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:21,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:21,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:21,004 INFO L87 Difference]: Start difference. First operand 12209 states and 38285 transitions. Second operand 3 states. [2019-12-27 03:15:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:21,056 INFO L93 Difference]: Finished difference Result 11551 states and 35637 transitions. [2019-12-27 03:15:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:21,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 03:15:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:21,087 INFO L225 Difference]: With dead ends: 11551 [2019-12-27 03:15:21,087 INFO L226 Difference]: Without dead ends: 11551 [2019-12-27 03:15:21,087 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 03:15:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11551 states. [2019-12-27 03:15:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11551 to 11471. [2019-12-27 03:15:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-12-27 03:15:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 35405 transitions. [2019-12-27 03:15:21,714 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 35405 transitions. Word has length 17 [2019-12-27 03:15:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:21,715 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 35405 transitions. [2019-12-27 03:15:21,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 35405 transitions. [2019-12-27 03:15:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:15:21,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:21,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:21,723 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1923749814, now seen corresponding path program 1 times [2019-12-27 03:15:21,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:21,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408790400] [2019-12-27 03:15:21,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:21,824 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 03:15:21,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408790400] [2019-12-27 03:15:21,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:21,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:15:21,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496335958] [2019-12-27 03:15:21,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:15:21,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:15:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:15:21,827 INFO L87 Difference]: Start difference. First operand 11471 states and 35405 transitions. Second operand 4 states. [2019-12-27 03:15:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:21,864 INFO L93 Difference]: Finished difference Result 2185 states and 5443 transitions. [2019-12-27 03:15:21,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:15:21,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 03:15:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:21,869 INFO L225 Difference]: With dead ends: 2185 [2019-12-27 03:15:21,869 INFO L226 Difference]: Without dead ends: 1541 [2019-12-27 03:15:21,869 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 03:15:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2019-12-27 03:15:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1541. [2019-12-27 03:15:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2019-12-27 03:15:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 3399 transitions. [2019-12-27 03:15:21,896 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 3399 transitions. Word has length 17 [2019-12-27 03:15:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:21,896 INFO L462 AbstractCegarLoop]: Abstraction has 1541 states and 3399 transitions. [2019-12-27 03:15:21,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:15:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 3399 transitions. [2019-12-27 03:15:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:15:21,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:21,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:21,899 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-27 03:15:21,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:21,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339415217] [2019-12-27 03:15:21,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:22,030 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 03:15:22,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339415217] [2019-12-27 03:15:22,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:22,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:15:22,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523664469] [2019-12-27 03:15:22,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:15:22,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:22,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:15:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:15:22,033 INFO L87 Difference]: Start difference. First operand 1541 states and 3399 transitions. Second operand 6 states. [2019-12-27 03:15:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:22,658 INFO L93 Difference]: Finished difference Result 4256 states and 9287 transitions. [2019-12-27 03:15:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:15:22,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 03:15:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:22,667 INFO L225 Difference]: With dead ends: 4256 [2019-12-27 03:15:22,667 INFO L226 Difference]: Without dead ends: 4221 [2019-12-27 03:15:22,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:15:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2019-12-27 03:15:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 1875. [2019-12-27 03:15:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-12-27 03:15:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 4212 transitions. [2019-12-27 03:15:22,718 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 4212 transitions. Word has length 25 [2019-12-27 03:15:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:22,719 INFO L462 AbstractCegarLoop]: Abstraction has 1875 states and 4212 transitions. [2019-12-27 03:15:22,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:15:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 4212 transitions. [2019-12-27 03:15:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:15:22,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:22,723 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 03:15:22,723 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:22,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-27 03:15:22,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:22,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588969141] [2019-12-27 03:15:22,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:22,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588969141] [2019-12-27 03:15:22,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:22,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:15:22,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66732773] [2019-12-27 03:15:22,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:15:22,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:22,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:15:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:15:22,846 INFO L87 Difference]: Start difference. First operand 1875 states and 4212 transitions. Second operand 6 states. [2019-12-27 03:15:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:23,447 INFO L93 Difference]: Finished difference Result 3971 states and 8602 transitions. [2019-12-27 03:15:23,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:15:23,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 03:15:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:23,454 INFO L225 Difference]: With dead ends: 3971 [2019-12-27 03:15:23,455 INFO L226 Difference]: Without dead ends: 3942 [2019-12-27 03:15:23,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:15:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2019-12-27 03:15:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 1854. [2019-12-27 03:15:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-12-27 03:15:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4184 transitions. [2019-12-27 03:15:23,501 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4184 transitions. Word has length 26 [2019-12-27 03:15:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:23,502 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 4184 transitions. [2019-12-27 03:15:23,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:15:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4184 transitions. [2019-12-27 03:15:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:15:23,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:23,505 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] [2019-12-27 03:15:23,505 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-27 03:15:23,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:23,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694878736] [2019-12-27 03:15:23,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:23,574 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 03:15:23,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694878736] [2019-12-27 03:15:23,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:23,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:15:23,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883345206] [2019-12-27 03:15:23,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:15:23,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:15:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:15:23,576 INFO L87 Difference]: Start difference. First operand 1854 states and 4184 transitions. Second operand 5 states. [2019-12-27 03:15:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:23,613 INFO L93 Difference]: Finished difference Result 968 states and 2169 transitions. [2019-12-27 03:15:23,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:15:23,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:15:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:23,615 INFO L225 Difference]: With dead ends: 968 [2019-12-27 03:15:23,616 INFO L226 Difference]: Without dead ends: 886 [2019-12-27 03:15:23,616 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 03:15:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-27 03:15:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-12-27 03:15:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-12-27 03:15:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1985 transitions. [2019-12-27 03:15:23,756 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1985 transitions. Word has length 28 [2019-12-27 03:15:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:23,756 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1985 transitions. [2019-12-27 03:15:23,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:15:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1985 transitions. [2019-12-27 03:15:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:15:23,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:23,760 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 03:15:23,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-27 03:15:23,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:23,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72284744] [2019-12-27 03:15:23,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:23,858 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 03:15:23,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72284744] [2019-12-27 03:15:23,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:23,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:15:23,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655444990] [2019-12-27 03:15:23,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:15:23,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:15:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:15:23,860 INFO L87 Difference]: Start difference. First operand 886 states and 1985 transitions. Second operand 7 states. [2019-12-27 03:15:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:24,148 INFO L93 Difference]: Finished difference Result 2885 states and 6293 transitions. [2019-12-27 03:15:24,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:15:24,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 03:15:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:24,152 INFO L225 Difference]: With dead ends: 2885 [2019-12-27 03:15:24,152 INFO L226 Difference]: Without dead ends: 1947 [2019-12-27 03:15:24,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:15:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-12-27 03:15:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1014. [2019-12-27 03:15:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 03:15:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2260 transitions. [2019-12-27 03:15:24,176 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2260 transitions. Word has length 52 [2019-12-27 03:15:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:24,177 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2260 transitions. [2019-12-27 03:15:24,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:15:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2260 transitions. [2019-12-27 03:15:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:15:24,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:24,181 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 03:15:24,182 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash -744775922, now seen corresponding path program 2 times [2019-12-27 03:15:24,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:24,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875633442] [2019-12-27 03:15:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:24,336 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 03:15:24,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875633442] [2019-12-27 03:15:24,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:24,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:15:24,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194378591] [2019-12-27 03:15:24,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:15:24,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:15:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:15:24,340 INFO L87 Difference]: Start difference. First operand 1014 states and 2260 transitions. Second operand 7 states. [2019-12-27 03:15:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:25,474 INFO L93 Difference]: Finished difference Result 2575 states and 5521 transitions. [2019-12-27 03:15:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:15:25,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 03:15:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:25,479 INFO L225 Difference]: With dead ends: 2575 [2019-12-27 03:15:25,479 INFO L226 Difference]: Without dead ends: 2551 [2019-12-27 03:15:25,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:15:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-12-27 03:15:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 1247. [2019-12-27 03:15:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-27 03:15:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2756 transitions. [2019-12-27 03:15:25,510 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2756 transitions. Word has length 52 [2019-12-27 03:15:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:25,511 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2756 transitions. [2019-12-27 03:15:25,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:15:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2756 transitions. [2019-12-27 03:15:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:15:25,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:25,515 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 03:15:25,515 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1616489678, now seen corresponding path program 3 times [2019-12-27 03:15:25,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:25,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353244186] [2019-12-27 03:15:25,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:25,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353244186] [2019-12-27 03:15:25,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:25,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:25,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051597290] [2019-12-27 03:15:25,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:25,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:25,597 INFO L87 Difference]: Start difference. First operand 1247 states and 2756 transitions. Second operand 3 states. [2019-12-27 03:15:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:25,666 INFO L93 Difference]: Finished difference Result 1531 states and 3357 transitions. [2019-12-27 03:15:25,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:25,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:15:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:25,672 INFO L225 Difference]: With dead ends: 1531 [2019-12-27 03:15:25,672 INFO L226 Difference]: Without dead ends: 1531 [2019-12-27 03:15:25,673 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 03:15:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-12-27 03:15:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1162. [2019-12-27 03:15:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-12-27 03:15:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 2568 transitions. [2019-12-27 03:15:25,693 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 2568 transitions. Word has length 52 [2019-12-27 03:15:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:25,693 INFO L462 AbstractCegarLoop]: Abstraction has 1162 states and 2568 transitions. [2019-12-27 03:15:25,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 2568 transitions. [2019-12-27 03:15:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:15:25,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:25,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:25,697 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-27 03:15:25,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:25,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559571272] [2019-12-27 03:15:25,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:15:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:15:25,894 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:15:25,894 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:15:25,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| 4)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24| 1)) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24|) |v_ULTIMATE.start_main_~#t1715~0.offset_18| 0)) |v_#memory_int_13|) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_24|) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:15:25,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:15:25,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-27 03:15:25,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2126613566 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In2126613566 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2126613566| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In2126613566 |P0Thread1of1ForFork0_#t~ite5_Out2126613566|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2126613566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126613566} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2126613566|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2126613566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126613566} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:15:25,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1741270289 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1741270289| |P1Thread1of1ForFork1_#t~ite15_Out1741270289|) (= ~x$w_buff0~0_In1741270289 |P1Thread1of1ForFork1_#t~ite14_Out1741270289|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1741270289 256) 0))) (or (and .cse0 (= (mod ~x$w_buff1_used~0_In1741270289 256) 0)) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1741270289 256))) (= (mod ~x$w_buff0_used~0_In1741270289 256) 0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite14_In1741270289| |P1Thread1of1ForFork1_#t~ite14_Out1741270289|) (not .cse1) (= ~x$w_buff0~0_In1741270289 |P1Thread1of1ForFork1_#t~ite15_Out1741270289|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1741270289, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1741270289, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1741270289, ~weak$$choice2~0=~weak$$choice2~0_In1741270289, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1741270289, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1741270289|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741270289} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1741270289, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1741270289, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1741270289, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1741270289|, ~weak$$choice2~0=~weak$$choice2~0_In1741270289, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1741270289, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1741270289|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741270289} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:15:25,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In997484892 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In997484892 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In997484892 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In997484892 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out997484892| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out997484892| ~x$w_buff1_used~0_In997484892) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In997484892, ~x$w_buff1_used~0=~x$w_buff1_used~0_In997484892, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In997484892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In997484892} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out997484892|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In997484892, ~x$w_buff1_used~0=~x$w_buff1_used~0_In997484892, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In997484892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In997484892} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:15:25,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1958352841 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1958352841 256)))) (or (and (= ~x$r_buff0_thd1~0_In-1958352841 ~x$r_buff0_thd1~0_Out-1958352841) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd1~0_Out-1958352841) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1958352841, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1958352841} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1958352841, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1958352841|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1958352841} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:15:25,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1007755313 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1007755313 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1007755313 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1007755313 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1007755313| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1007755313| ~x$r_buff1_thd1~0_In1007755313) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1007755313, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007755313, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007755313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1007755313} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1007755313, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1007755313|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007755313, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007755313, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1007755313} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:15:25,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 03:15:25,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1632406318 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-1632406318| ~x$w_buff1~0_In-1632406318) (= |P1Thread1of1ForFork1_#t~ite17_In-1632406318| |P1Thread1of1ForFork1_#t~ite17_Out-1632406318|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1632406318 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1632406318 256))) (= (mod ~x$w_buff0_used~0_In-1632406318 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1632406318 256))))) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out-1632406318| |P1Thread1of1ForFork1_#t~ite17_Out-1632406318|) (= ~x$w_buff1~0_In-1632406318 |P1Thread1of1ForFork1_#t~ite17_Out-1632406318|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1632406318, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1632406318, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1632406318, ~weak$$choice2~0=~weak$$choice2~0_In-1632406318, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1632406318, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1632406318|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1632406318} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1632406318|, ~x$w_buff1~0=~x$w_buff1~0_In-1632406318, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1632406318, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1632406318, ~weak$$choice2~0=~weak$$choice2~0_In-1632406318, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1632406318, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1632406318|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1632406318} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 03:15:25,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1366968815 256)))) (or (and (= ~x$w_buff0_used~0_In-1366968815 |P1Thread1of1ForFork1_#t~ite20_Out-1366968815|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1366968815 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1366968815 256) 0) (and (= (mod ~x$w_buff1_used~0_In-1366968815 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd2~0_In-1366968815 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1366968815| |P1Thread1of1ForFork1_#t~ite20_Out-1366968815|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-1366968815| |P1Thread1of1ForFork1_#t~ite20_Out-1366968815|) (= ~x$w_buff0_used~0_In-1366968815 |P1Thread1of1ForFork1_#t~ite21_Out-1366968815|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1366968815|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1366968815, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1366968815, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1366968815, ~weak$$choice2~0=~weak$$choice2~0_In-1366968815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1366968815} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1366968815|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1366968815, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1366968815, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1366968815|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1366968815, ~weak$$choice2~0=~weak$$choice2~0_In-1366968815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1366968815} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 03:15:25,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 03:15:25,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In514962470 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out514962470| |P1Thread1of1ForFork1_#t~ite30_Out514962470|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In514962470 256)))) (or (= (mod ~x$w_buff0_used~0_In514962470 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In514962470 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In514962470 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite29_Out514962470| ~x$r_buff1_thd2~0_In514962470)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In514962470| |P1Thread1of1ForFork1_#t~ite29_Out514962470|) (= |P1Thread1of1ForFork1_#t~ite30_Out514962470| ~x$r_buff1_thd2~0_In514962470)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In514962470|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In514962470, ~x$w_buff1_used~0=~x$w_buff1_used~0_In514962470, ~weak$$choice2~0=~weak$$choice2~0_In514962470, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In514962470, ~x$w_buff0_used~0=~x$w_buff0_used~0_In514962470} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out514962470|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out514962470|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In514962470, ~x$w_buff1_used~0=~x$w_buff1_used~0_In514962470, ~weak$$choice2~0=~weak$$choice2~0_In514962470, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In514962470, ~x$w_buff0_used~0=~x$w_buff0_used~0_In514962470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 03:15:25,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 03:15:25,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-250212761 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-250212761 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-250212761| ~x~0_In-250212761) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-250212761| ~x$w_buff1~0_In-250212761) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-250212761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-250212761, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-250212761, ~x~0=~x~0_In-250212761} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-250212761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-250212761, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-250212761, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-250212761|, ~x~0=~x~0_In-250212761} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:15:25,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:15:25,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-891380301 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-891380301 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-891380301| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-891380301 |P1Thread1of1ForFork1_#t~ite34_Out-891380301|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-891380301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-891380301} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-891380301|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-891380301, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-891380301} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:15:25,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In747185224 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In747185224 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In747185224 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In747185224 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In747185224 |P1Thread1of1ForFork1_#t~ite35_Out747185224|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out747185224|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In747185224, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In747185224, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In747185224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In747185224} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In747185224, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In747185224, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out747185224|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In747185224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In747185224} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:15:25,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-694809980 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-694809980 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-694809980| ~x$r_buff0_thd2~0_In-694809980) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-694809980| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-694809980, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-694809980} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-694809980, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-694809980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-694809980} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:15:25,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2123425606 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2123425606 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-2123425606 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-2123425606 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-2123425606 |P1Thread1of1ForFork1_#t~ite37_Out-2123425606|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-2123425606|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2123425606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2123425606, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123425606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123425606} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2123425606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2123425606, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123425606, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2123425606|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123425606} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:15:25,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:15:25,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:15:25,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1475573740 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1475573740 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1475573740| ~x$w_buff1~0_In1475573740) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1475573740| ~x~0_In1475573740)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1475573740, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1475573740, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1475573740, ~x~0=~x~0_In1475573740} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1475573740|, ~x$w_buff1~0=~x$w_buff1~0_In1475573740, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1475573740, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1475573740, ~x~0=~x~0_In1475573740} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 03:15:25,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 03:15:25,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1505003802 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1505003802 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1505003802| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1505003802| ~x$w_buff0_used~0_In-1505003802)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1505003802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1505003802} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1505003802, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1505003802|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1505003802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:15:25,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In555013854 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In555013854 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In555013854 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In555013854 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out555013854| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In555013854 |ULTIMATE.start_main_#t~ite43_Out555013854|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In555013854, ~x$w_buff1_used~0=~x$w_buff1_used~0_In555013854, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In555013854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In555013854} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In555013854, ~x$w_buff1_used~0=~x$w_buff1_used~0_In555013854, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out555013854|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In555013854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In555013854} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:15:25,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In445856354 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In445856354 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out445856354| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out445856354| ~x$r_buff0_thd0~0_In445856354)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In445856354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In445856354} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In445856354, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out445856354|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In445856354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:15:25,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In1551455575 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1551455575 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1551455575 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1551455575 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1551455575| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out1551455575| ~x$r_buff1_thd0~0_In1551455575) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1551455575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1551455575, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1551455575, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1551455575} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1551455575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1551455575, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1551455575, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1551455575|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1551455575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:15:25,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:15:25,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:15:25 BasicIcfg [2019-12-27 03:15:25,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:15:25,996 INFO L168 Benchmark]: Toolchain (without parser) took 17463.46 ms. Allocated memory was 138.9 MB in the beginning and 727.7 MB in the end (delta: 588.8 MB). Free memory was 102.3 MB in the beginning and 178.1 MB in the end (delta: -75.9 MB). Peak memory consumption was 512.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:25,997 INFO L168 Benchmark]: CDTParser took 0.50 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:15:25,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.56 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 154.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:25,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.83 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:26,000 INFO L168 Benchmark]: Boogie Preprocessor took 46.39 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:26,000 INFO L168 Benchmark]: RCFGBuilder took 838.90 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 105.8 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:26,005 INFO L168 Benchmark]: TraceAbstraction took 15768.67 ms. Allocated memory was 202.9 MB in the beginning and 727.7 MB in the end (delta: 524.8 MB). Free memory was 105.1 MB in the beginning and 178.1 MB in the end (delta: -73.0 MB). Peak memory consumption was 451.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:26,009 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.50 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.56 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 154.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.83 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.39 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.90 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 105.8 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15768.67 ms. Allocated memory was 202.9 MB in the beginning and 727.7 MB in the end (delta: 524.8 MB). Free memory was 105.1 MB in the beginning and 178.1 MB in the end (delta: -73.0 MB). Peak memory consumption was 451.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1694 SDtfs, 1984 SDslu, 3404 SDs, 0 SdLazy, 2024 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12234occurred 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.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 9912 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 37683 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...