/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:48:30,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:48:30,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:48:30,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:48:30,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:48:30,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:48:30,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:48:30,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:48:30,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:48:30,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:48:30,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:48:30,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:48:30,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:48:30,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:48:30,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:48:30,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:48:30,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:48:30,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:48:30,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:48:30,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:48:30,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:48:30,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:48:30,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:48:30,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:48:30,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:48:30,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:48:30,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:48:30,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:48:30,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:48:30,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:48:30,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:48:30,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:48:30,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:48:30,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:48:30,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:48:30,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:48:30,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:48:30,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:48:30,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:48:30,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:48:30,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:48:30,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:48:30,399 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:48:30,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:48:30,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:48:30,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:48:30,401 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:48:30,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:48:30,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:48:30,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:48:30,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:48:30,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:48:30,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:48:30,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:48:30,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:48:30,403 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:48:30,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:48:30,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:48:30,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:48:30,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:48:30,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:48:30,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:48:30,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:48:30,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:48:30,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:48:30,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:48:30,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:48:30,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:48:30,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:48:30,406 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:48:30,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:48:30,406 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:48:30,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:48:30,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:48:30,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:48:30,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:48:30,715 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:48:30,715 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:48:30,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-27 16:48:30,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f471ec6/0bdba69e43414a40ab12a54869ce01af/FLAGbe23a1134 [2019-12-27 16:48:31,313 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:48:31,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-27 16:48:31,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f471ec6/0bdba69e43414a40ab12a54869ce01af/FLAGbe23a1134 [2019-12-27 16:48:31,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f471ec6/0bdba69e43414a40ab12a54869ce01af [2019-12-27 16:48:31,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:48:31,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:48:31,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:31,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:48:31,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:48:31,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:31" (1/1) ... [2019-12-27 16:48:31,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f8f36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:31, skipping insertion in model container [2019-12-27 16:48:31,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:48:31" (1/1) ... [2019-12-27 16:48:31,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:48:31,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:48:32,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:32,233 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:48:32,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:48:32,411 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:48:32,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32 WrapperNode [2019-12-27 16:48:32,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:48:32,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:32,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:48:32,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:48:32,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:48:32,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:48:32,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:48:32,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:48:32,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (1/1) ... [2019-12-27 16:48:32,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:48:32,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:48:32,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:48:32,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:48:32,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (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 16:48:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:48:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:48:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:48:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:48:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:48:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:48:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:48:32,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:48:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:48:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:48:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:48:32,574 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 16:48:33,290 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:48:33,290 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:48:33,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:33 BoogieIcfgContainer [2019-12-27 16:48:33,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:48:33,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:48:33,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:48:33,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:48:33,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:48:31" (1/3) ... [2019-12-27 16:48:33,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc1340c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:33, skipping insertion in model container [2019-12-27 16:48:33,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:48:32" (2/3) ... [2019-12-27 16:48:33,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc1340c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:48:33, skipping insertion in model container [2019-12-27 16:48:33,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:48:33" (3/3) ... [2019-12-27 16:48:33,300 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc.i [2019-12-27 16:48:33,309 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:48:33,309 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:48:33,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:48:33,317 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:48:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,421 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:48:33,441 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:48:33,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:48:33,462 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:48:33,462 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:48:33,462 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:48:33,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:48:33,462 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:48:33,462 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:48:33,462 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:48:33,479 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 16:48:33,481 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:33,574 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:33,574 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:33,588 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:33,609 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 16:48:33,655 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 16:48:33,655 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:48:33,662 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:48:33,678 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:48:33,679 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:48:38,655 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 16:48:38,765 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 16:48:39,004 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-27 16:48:39,004 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 16:48:39,008 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 16:48:39,610 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-27 16:48:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-27 16:48:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:48:39,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:39,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:48:39,620 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-27 16:48:39,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:39,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639435301] [2019-12-27 16:48:39,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:39,910 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 16:48:39,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639435301] [2019-12-27 16:48:39,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:39,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:48:39,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [518380146] [2019-12-27 16:48:39,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:39,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:39,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:48:39,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:39,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:39,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:39,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:39,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:39,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:39,957 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-27 16:48:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:40,179 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-27 16:48:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:40,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:48:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:40,259 INFO L225 Difference]: With dead ends: 8598 [2019-12-27 16:48:40,259 INFO L226 Difference]: Without dead ends: 7662 [2019-12-27 16:48:40,261 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 16:48:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-27 16:48:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-27 16:48:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-27 16:48:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-27 16:48:40,656 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-27 16:48:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:40,656 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-27 16:48:40,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-27 16:48:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:48:40,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:40,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:40,660 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-27 16:48:40,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:40,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977831650] [2019-12-27 16:48:40,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:40,753 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 16:48:40,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977831650] [2019-12-27 16:48:40,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:40,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:40,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [238738773] [2019-12-27 16:48:40,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:40,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:40,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:48:40,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:40,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:40,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:40,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:40,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:40,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:40,762 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-27 16:48:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:40,792 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-27 16:48:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:40,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:48:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:40,800 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 16:48:40,800 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 16:48:40,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 16:48:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 16:48:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 16:48:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-27 16:48:40,912 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-27 16:48:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:40,912 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-27 16:48:40,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-27 16:48:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:48:40,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:40,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:40,917 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-27 16:48:40,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:40,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938933648] [2019-12-27 16:48:40,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:41,013 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 16:48:41,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938933648] [2019-12-27 16:48:41,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:41,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:41,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750680088] [2019-12-27 16:48:41,014 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:41,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:41,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:48:41,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:41,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:41,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:41,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:41,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:41,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:41,020 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-27 16:48:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:41,074 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-27 16:48:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:41,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 16:48:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:41,085 INFO L225 Difference]: With dead ends: 1943 [2019-12-27 16:48:41,085 INFO L226 Difference]: Without dead ends: 1943 [2019-12-27 16:48:41,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-27 16:48:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-27 16:48:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-27 16:48:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-27 16:48:41,128 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-27 16:48:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:41,129 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-27 16:48:41,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-27 16:48:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:48:41,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:41,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:41,131 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:41,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:41,131 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-27 16:48:41,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:41,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002541154] [2019-12-27 16:48:41,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:41,209 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 16:48:41,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002541154] [2019-12-27 16:48:41,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:41,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:41,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335754599] [2019-12-27 16:48:41,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:41,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:41,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:48:41,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:41,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:41,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:48:41,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:48:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:48:41,216 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-27 16:48:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:41,407 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-27 16:48:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:41,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:48:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:41,417 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 16:48:41,418 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 16:48:41,418 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 16:48:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 16:48:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-27 16:48:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-27 16:48:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-27 16:48:41,459 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-27 16:48:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:41,459 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-27 16:48:41,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:48:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-27 16:48:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:48:41,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:41,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:41,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-27 16:48:41,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:41,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833429149] [2019-12-27 16:48:41,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:41,522 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 16:48:41,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833429149] [2019-12-27 16:48:41,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:41,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:41,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365286373] [2019-12-27 16:48:41,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:41,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:41,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:48:41,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:41,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:41,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:48:41,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:41,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:48:41,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:48:41,529 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-27 16:48:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:41,702 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-27 16:48:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:41,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:48:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:41,713 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 16:48:41,713 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 16:48:41,714 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 16:48:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 16:48:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-27 16:48:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-27 16:48:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-27 16:48:41,755 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-27 16:48:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:41,756 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-27 16:48:41,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:48:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-27 16:48:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:48:41,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:41,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:41,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-27 16:48:41,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:41,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877287121] [2019-12-27 16:48:41,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:41,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877287121] [2019-12-27 16:48:41,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:41,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:41,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106970209] [2019-12-27 16:48:41,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:41,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:41,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 16:48:41,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:41,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:41,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:41,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:41,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:41,952 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-27 16:48:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:42,239 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-27 16:48:42,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:48:42,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 16:48:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:42,252 INFO L225 Difference]: With dead ends: 2258 [2019-12-27 16:48:42,252 INFO L226 Difference]: Without dead ends: 2258 [2019-12-27 16:48:42,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:48:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-27 16:48:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-27 16:48:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-27 16:48:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-27 16:48:42,300 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-27 16:48:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:42,301 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-27 16:48:42,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-27 16:48:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:48:42,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:42,304 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 16:48:42,304 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:42,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-27 16:48:42,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:42,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770079830] [2019-12-27 16:48:42,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:42,408 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 16:48:42,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770079830] [2019-12-27 16:48:42,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:42,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:48:42,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454672241] [2019-12-27 16:48:42,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:42,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:42,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 16:48:42,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:42,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:42,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:42,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:42,428 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-27 16:48:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:42,441 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-27 16:48:42,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:42,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 16:48:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:42,464 INFO L225 Difference]: With dead ends: 2001 [2019-12-27 16:48:42,464 INFO L226 Difference]: Without dead ends: 2001 [2019-12-27 16:48:42,464 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 16:48:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-27 16:48:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-27 16:48:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 16:48:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-27 16:48:42,508 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-27 16:48:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:42,508 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-27 16:48:42,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-27 16:48:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:48:42,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:42,511 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 16:48:42,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-27 16:48:42,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:42,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59337516] [2019-12-27 16:48:42,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:42,627 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 16:48:42,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59337516] [2019-12-27 16:48:42,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:42,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:48:42,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903952096] [2019-12-27 16:48:42,628 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:42,633 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:42,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:48:42,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:42,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:42,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:42,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:42,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:42,641 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-27 16:48:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:42,712 INFO L93 Difference]: Finished difference Result 2103 states and 4690 transitions. [2019-12-27 16:48:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:48:42,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:48:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:42,719 INFO L225 Difference]: With dead ends: 2103 [2019-12-27 16:48:42,719 INFO L226 Difference]: Without dead ends: 2103 [2019-12-27 16:48:42,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-12-27 16:48:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2103. [2019-12-27 16:48:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2103 states. [2019-12-27 16:48:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 4690 transitions. [2019-12-27 16:48:42,759 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 4690 transitions. Word has length 26 [2019-12-27 16:48:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:42,759 INFO L462 AbstractCegarLoop]: Abstraction has 2103 states and 4690 transitions. [2019-12-27 16:48:42,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 4690 transitions. [2019-12-27 16:48:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:48:42,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:42,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:42,762 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-27 16:48:42,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:42,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813212413] [2019-12-27 16:48:42,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:42,837 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 16:48:42,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813212413] [2019-12-27 16:48:42,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:42,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:48:42,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322417552] [2019-12-27 16:48:42,839 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:42,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:42,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 16:48:42,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:42,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:48:42,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:48:42,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:42,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:48:42,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:48:42,963 INFO L87 Difference]: Start difference. First operand 2103 states and 4690 transitions. Second operand 8 states. [2019-12-27 16:48:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:43,648 INFO L93 Difference]: Finished difference Result 2987 states and 6548 transitions. [2019-12-27 16:48:43,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:48:43,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 16:48:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:43,655 INFO L225 Difference]: With dead ends: 2987 [2019-12-27 16:48:43,656 INFO L226 Difference]: Without dead ends: 2987 [2019-12-27 16:48:43,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:48:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2019-12-27 16:48:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2570. [2019-12-27 16:48:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-27 16:48:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 5722 transitions. [2019-12-27 16:48:43,707 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 5722 transitions. Word has length 27 [2019-12-27 16:48:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:43,707 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 5722 transitions. [2019-12-27 16:48:43,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:48:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 5722 transitions. [2019-12-27 16:48:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:48:43,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:43,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:43,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990422, now seen corresponding path program 1 times [2019-12-27 16:48:43,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:43,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691953967] [2019-12-27 16:48:43,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:43,885 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 16:48:43,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691953967] [2019-12-27 16:48:43,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:43,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:43,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [913904868] [2019-12-27 16:48:43,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:43,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:43,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:48:43,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:43,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:43,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:43,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:43,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:43,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:43,896 INFO L87 Difference]: Start difference. First operand 2570 states and 5722 transitions. Second operand 5 states. [2019-12-27 16:48:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:44,159 INFO L93 Difference]: Finished difference Result 3072 states and 6694 transitions. [2019-12-27 16:48:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:48:44,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:48:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:44,168 INFO L225 Difference]: With dead ends: 3072 [2019-12-27 16:48:44,168 INFO L226 Difference]: Without dead ends: 3072 [2019-12-27 16:48:44,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:48:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-27 16:48:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2505. [2019-12-27 16:48:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-12-27 16:48:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5590 transitions. [2019-12-27 16:48:44,221 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5590 transitions. Word has length 27 [2019-12-27 16:48:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:44,222 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 5590 transitions. [2019-12-27 16:48:44,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5590 transitions. [2019-12-27 16:48:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:48:44,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:44,227 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 16:48:44,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-27 16:48:44,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:44,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449453505] [2019-12-27 16:48:44,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:44,269 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 16:48:44,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449453505] [2019-12-27 16:48:44,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:44,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:48:44,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1407531166] [2019-12-27 16:48:44,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:44,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:44,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 16:48:44,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:44,306 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:48:44,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:48:44,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:44,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:48:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:44,307 INFO L87 Difference]: Start difference. First operand 2505 states and 5590 transitions. Second operand 5 states. [2019-12-27 16:48:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:44,337 INFO L93 Difference]: Finished difference Result 1400 states and 2990 transitions. [2019-12-27 16:48:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:48:44,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:48:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:44,342 INFO L225 Difference]: With dead ends: 1400 [2019-12-27 16:48:44,342 INFO L226 Difference]: Without dead ends: 1400 [2019-12-27 16:48:44,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:48:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-12-27 16:48:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1305. [2019-12-27 16:48:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-12-27 16:48:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2815 transitions. [2019-12-27 16:48:44,369 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2815 transitions. Word has length 28 [2019-12-27 16:48:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:44,370 INFO L462 AbstractCegarLoop]: Abstraction has 1305 states and 2815 transitions. [2019-12-27 16:48:44,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:48:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2815 transitions. [2019-12-27 16:48:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:48:44,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:44,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:44,373 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-27 16:48:44,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:44,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132671655] [2019-12-27 16:48:44,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:44,461 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 16:48:44,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132671655] [2019-12-27 16:48:44,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:44,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:48:44,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842344524] [2019-12-27 16:48:44,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:44,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:44,516 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 130 transitions. [2019-12-27 16:48:44,516 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:44,606 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:48:44,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:48:44,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:48:44,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:48:44,607 INFO L87 Difference]: Start difference. First operand 1305 states and 2815 transitions. Second operand 10 states. [2019-12-27 16:48:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:45,074 INFO L93 Difference]: Finished difference Result 3479 states and 7322 transitions. [2019-12-27 16:48:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:48:45,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 16:48:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:45,080 INFO L225 Difference]: With dead ends: 3479 [2019-12-27 16:48:45,080 INFO L226 Difference]: Without dead ends: 2269 [2019-12-27 16:48:45,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:48:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2019-12-27 16:48:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1348. [2019-12-27 16:48:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-27 16:48:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2908 transitions. [2019-12-27 16:48:45,117 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2908 transitions. Word has length 50 [2019-12-27 16:48:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:45,117 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2908 transitions. [2019-12-27 16:48:45,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:48:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2908 transitions. [2019-12-27 16:48:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 16:48:45,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:45,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:45,121 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-27 16:48:45,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:45,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154364614] [2019-12-27 16:48:45,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:45,211 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 16:48:45,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154364614] [2019-12-27 16:48:45,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:45,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:45,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102095306] [2019-12-27 16:48:45,212 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:45,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:45,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 150 transitions. [2019-12-27 16:48:45,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:45,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:48:45,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:45,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:45,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:45,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:45,297 INFO L87 Difference]: Start difference. First operand 1348 states and 2908 transitions. Second operand 3 states. [2019-12-27 16:48:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:45,353 INFO L93 Difference]: Finished difference Result 1629 states and 3459 transitions. [2019-12-27 16:48:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:45,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 16:48:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:45,358 INFO L225 Difference]: With dead ends: 1629 [2019-12-27 16:48:45,358 INFO L226 Difference]: Without dead ends: 1629 [2019-12-27 16:48:45,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 16:48:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-27 16:48:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1368. [2019-12-27 16:48:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-12-27 16:48:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2946 transitions. [2019-12-27 16:48:45,393 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2946 transitions. Word has length 50 [2019-12-27 16:48:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:45,394 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2946 transitions. [2019-12-27 16:48:45,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2946 transitions. [2019-12-27 16:48:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:48:45,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:45,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:45,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-27 16:48:45,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:45,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151237556] [2019-12-27 16:48:45,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:45,717 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 16:48:45,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151237556] [2019-12-27 16:48:45,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:45,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:45,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640892492] [2019-12-27 16:48:45,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:45,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:45,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 99 transitions. [2019-12-27 16:48:45,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:45,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:48:45,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:48:45,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:45,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:48:45,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:48:45,912 INFO L87 Difference]: Start difference. First operand 1368 states and 2946 transitions. Second operand 12 states. [2019-12-27 16:48:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:46,899 INFO L93 Difference]: Finished difference Result 1933 states and 3975 transitions. [2019-12-27 16:48:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:48:46,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-12-27 16:48:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:46,904 INFO L225 Difference]: With dead ends: 1933 [2019-12-27 16:48:46,904 INFO L226 Difference]: Without dead ends: 1933 [2019-12-27 16:48:46,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:48:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-27 16:48:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1266. [2019-12-27 16:48:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-27 16:48:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 2686 transitions. [2019-12-27 16:48:46,929 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 2686 transitions. Word has length 51 [2019-12-27 16:48:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:46,929 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 2686 transitions. [2019-12-27 16:48:46,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:48:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 2686 transitions. [2019-12-27 16:48:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 16:48:46,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:46,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:46,933 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-27 16:48:46,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:46,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356114339] [2019-12-27 16:48:46,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:48:47,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356114339] [2019-12-27 16:48:47,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:47,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:47,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978315415] [2019-12-27 16:48:47,001 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:47,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:47,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 16:48:47,059 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:47,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:47,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:47,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:47,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:47,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:47,060 INFO L87 Difference]: Start difference. First operand 1266 states and 2686 transitions. Second operand 3 states. [2019-12-27 16:48:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:47,077 INFO L93 Difference]: Finished difference Result 1265 states and 2684 transitions. [2019-12-27 16:48:47,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:47,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 16:48:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:47,081 INFO L225 Difference]: With dead ends: 1265 [2019-12-27 16:48:47,082 INFO L226 Difference]: Without dead ends: 1265 [2019-12-27 16:48:47,082 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 16:48:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-27 16:48:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1007. [2019-12-27 16:48:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-12-27 16:48:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 2166 transitions. [2019-12-27 16:48:47,099 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 2166 transitions. Word has length 51 [2019-12-27 16:48:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:47,099 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 2166 transitions. [2019-12-27 16:48:47,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 2166 transitions. [2019-12-27 16:48:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:48:47,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:47,102 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 16:48:47,102 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:47,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-27 16:48:47,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:47,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30791220] [2019-12-27 16:48:47,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:47,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:48:47,236 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:48:47,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= (select .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35|) 0) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_35|) |v_ULTIMATE.start_main_~#t897~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t897~0.base_35|) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t897~0.base_35| 1)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t897~0.base_35| 4)) (= |v_ULTIMATE.start_main_~#t897~0.offset_24| 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start_main_~#t897~0.offset=|v_ULTIMATE.start_main_~#t897~0.offset_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t897~0.base=|v_ULTIMATE.start_main_~#t897~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t898~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t897~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t897~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:48:47,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13|) |v_ULTIMATE.start_main_~#t898~0.offset_11| 1))) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t898~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t898~0.base_13|) (= |v_ULTIMATE.start_main_~#t898~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t898~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.base, ULTIMATE.start_main_~#t898~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:48:47,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1330887274|) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1330887274| P0Thread1of1ForFork0_~arg.offset_Out-1330887274) (= ~z$w_buff0~0_In-1330887274 ~z$w_buff1~0_Out-1330887274) (= 1 ~z$w_buff0_used~0_Out-1330887274) (= |P0Thread1of1ForFork0_#in~arg.base_In-1330887274| P0Thread1of1ForFork0_~arg.base_Out-1330887274) (= ~z$w_buff1_used~0_Out-1330887274 ~z$w_buff0_used~0_In-1330887274) (= (mod ~z$w_buff1_used~0_Out-1330887274 256) 0) (= ~z$w_buff0~0_Out-1330887274 1) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1330887274 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1330887274|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1330887274|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1330887274, ~z$w_buff0~0=~z$w_buff0~0_In-1330887274, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1330887274|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1330887274|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1330887274, ~z$w_buff0~0=~z$w_buff0~0_Out-1330887274, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1330887274, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1330887274, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1330887274|, ~z$w_buff1~0=~z$w_buff1~0_Out-1330887274, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1330887274, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1330887274|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1330887274} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:48:47,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1478837502 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1478837502| ~z$w_buff1_used~0_In1478837502) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In1478837502| |P1Thread1of1ForFork1_#t~ite23_Out1478837502|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1478837502| |P1Thread1of1ForFork1_#t~ite24_Out1478837502|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1478837502 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In1478837502 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1478837502 256))) (= (mod ~z$w_buff0_used~0_In1478837502 256) 0))) (= |P1Thread1of1ForFork1_#t~ite23_Out1478837502| ~z$w_buff1_used~0_In1478837502) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1478837502, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1478837502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478837502, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1478837502|, ~weak$$choice2~0=~weak$$choice2~0_In1478837502, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1478837502} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1478837502, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1478837502, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1478837502|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478837502, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1478837502|, ~weak$$choice2~0=~weak$$choice2~0_In1478837502, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1478837502} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 16:48:47,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:48:47,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:48:47,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2143413736 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2143413736 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2143413736| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2143413736| ~z$w_buff0_used~0_In2143413736) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2143413736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2143413736} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2143413736|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2143413736, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2143413736} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:48:47,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In2011372345 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2011372345 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2011372345 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In2011372345 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2011372345 |P0Thread1of1ForFork0_#t~ite6_Out2011372345|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out2011372345| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2011372345, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2011372345, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011372345, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2011372345} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2011372345|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2011372345, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2011372345, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2011372345, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2011372345} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:48:47,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1591661274 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1591661274 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-1591661274) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-1591661274 ~z$r_buff0_thd1~0_Out-1591661274) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591661274, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1591661274} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591661274, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1591661274|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1591661274} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:48:47,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-283123351 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-283123351 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-283123351 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-283123351 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-283123351|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In-283123351 |P0Thread1of1ForFork0_#t~ite8_Out-283123351|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-283123351, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-283123351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283123351, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-283123351} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-283123351, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-283123351|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-283123351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283123351, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-283123351} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:48:47,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-840319590 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out-840319590| |P1Thread1of1ForFork1_#t~ite33_Out-840319590|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-840319590 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-840319590| ~z~0_In-840319590)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-840319590| ~z$w_buff1~0_In-840319590) (not .cse1) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-840319590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840319590, ~z$w_buff1~0=~z$w_buff1~0_In-840319590, ~z~0=~z~0_In-840319590} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-840319590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840319590, ~z$w_buff1~0=~z$w_buff1~0_In-840319590, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-840319590|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-840319590|, ~z~0=~z~0_In-840319590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:48:47,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In396433575 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In396433575 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out396433575| ~z$w_buff0_used~0_In396433575) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out396433575|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In396433575, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In396433575} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In396433575, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out396433575|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In396433575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:48:47,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In745313903 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In745313903 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In745313903 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In745313903 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out745313903|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out745313903| ~z$w_buff1_used~0_In745313903) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In745313903, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In745313903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745313903, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In745313903} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In745313903, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In745313903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In745313903, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out745313903|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In745313903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:48:47,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1670606157 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1670606157 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1670606157| ~z$r_buff0_thd2~0_In-1670606157) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1670606157| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670606157, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1670606157} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1670606157, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1670606157, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1670606157|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:48:47,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1884121837 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1884121837 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1884121837 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1884121837 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1884121837| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1884121837| ~z$r_buff1_thd2~0_In1884121837) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1884121837, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1884121837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1884121837, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1884121837} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1884121837, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1884121837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1884121837, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1884121837, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1884121837|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:48:47,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:48:47,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:48:47,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:48:47,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-5651434 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-5651434 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-5651434| ~z$w_buff1~0_In-5651434) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-5651434| ~z~0_In-5651434)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-5651434, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5651434, ~z$w_buff1~0=~z$w_buff1~0_In-5651434, ~z~0=~z~0_In-5651434} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-5651434|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-5651434, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5651434, ~z$w_buff1~0=~z$w_buff1~0_In-5651434, ~z~0=~z~0_In-5651434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:48:47,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 16:48:47,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1769323737 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1769323737 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1769323737 |ULTIMATE.start_main_#t~ite42_Out1769323737|)) (and (= |ULTIMATE.start_main_#t~ite42_Out1769323737| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1769323737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1769323737} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1769323737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1769323737, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1769323737|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:48:47,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1169563958 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1169563958 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1169563958 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1169563958 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1169563958| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1169563958| ~z$w_buff1_used~0_In1169563958)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1169563958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1169563958, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1169563958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1169563958} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1169563958, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1169563958, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1169563958, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1169563958, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1169563958|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:48:47,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-29754471 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-29754471 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-29754471| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-29754471| ~z$r_buff0_thd0~0_In-29754471)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-29754471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-29754471} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-29754471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-29754471, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-29754471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:48:47,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-174783144 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-174783144 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-174783144 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-174783144 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-174783144| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-174783144| ~z$r_buff1_thd0~0_In-174783144)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174783144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174783144, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174783144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174783144} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174783144, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-174783144, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-174783144, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-174783144, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-174783144|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:48:47,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:48:47,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:48:47 BasicIcfg [2019-12-27 16:48:47,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:48:47,378 INFO L168 Benchmark]: Toolchain (without parser) took 15777.18 ms. Allocated memory was 138.4 MB in the beginning and 511.2 MB in the end (delta: 372.8 MB). Free memory was 101.7 MB in the beginning and 188.2 MB in the end (delta: -86.5 MB). Peak memory consumption was 286.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:47,378 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:48:47,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.10 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 156.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:47,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:47,383 INFO L168 Benchmark]: Boogie Preprocessor took 36.33 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:47,384 INFO L168 Benchmark]: RCFGBuilder took 782.48 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 108.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:47,385 INFO L168 Benchmark]: TraceAbstraction took 14081.47 ms. Allocated memory was 202.9 MB in the beginning and 511.2 MB in the end (delta: 308.3 MB). Free memory was 107.0 MB in the beginning and 188.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 227.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:47,392 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.12 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.10 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 156.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.33 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 152.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 782.48 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 108.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14081.47 ms. Allocated memory was 202.9 MB in the beginning and 511.2 MB in the end (delta: 308.3 MB). Free memory was 107.0 MB in the beginning and 188.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 227.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1857 SDtfs, 1838 SDslu, 4246 SDs, 0 SdLazy, 2401 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 34 SyntacticMatches, 19 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 4344 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 58407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...