/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:17:43,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:17:43,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:17:43,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:17:43,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:17:43,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:17:43,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:17:43,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:17:43,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:17:43,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:17:43,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:17:43,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:17:43,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:17:43,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:17:43,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:17:43,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:17:43,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:17:43,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:17:43,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:17:43,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:17:43,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:17:43,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:17:43,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:17:43,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:17:43,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:17:43,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:17:43,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:17:43,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:17:43,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:17:43,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:17:43,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:17:43,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:17:43,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:17:43,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:17:43,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:17:43,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:17:43,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:17:43,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:17:43,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:17:43,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:17:43,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:17:43,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:17:43,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:17:43,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:17:43,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:17:43,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:17:43,580 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:17:43,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:17:43,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:17:43,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:17:43,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:17:43,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:17:43,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:17:43,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:17:43,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:17:43,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:17:43,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:17:43,582 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:17:43,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:17:43,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:17:43,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:17:43,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:17:43,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:17:43,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:17:43,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:17:43,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:17:43,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:17:43,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:17:43,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:17:43,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:17:43,584 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:17:43,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:17:43,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:17:43,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:17:43,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:17:43,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:17:43,886 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:17:43,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-18 13:17:43,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac196132/ceac699a4a8c4f2881254c30d776af2d/FLAGa5c2dd9f2 [2019-12-18 13:17:44,483 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:17:44,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-18 13:17:44,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac196132/ceac699a4a8c4f2881254c30d776af2d/FLAGa5c2dd9f2 [2019-12-18 13:17:44,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac196132/ceac699a4a8c4f2881254c30d776af2d [2019-12-18 13:17:44,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:17:44,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:17:44,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:17:44,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:17:44,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:17:44,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:17:44" (1/1) ... [2019-12-18 13:17:44,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6a7e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:44, skipping insertion in model container [2019-12-18 13:17:44,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:17:44" (1/1) ... [2019-12-18 13:17:44,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:17:44,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:17:45,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:17:45,362 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:17:45,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:17:45,527 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:17:45,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45 WrapperNode [2019-12-18 13:17:45,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:17:45,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:17:45,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:17:45,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:17:45,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:17:45,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:17:45,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:17:45,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:17:45,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... [2019-12-18 13:17:45,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:17:45,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:17:45,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:17:45,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:17:45,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:17:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:17:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:17:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:17:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:17:45,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:17:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:17:45,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:17:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:17:45,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:17:45,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:17:45,690 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:17:46,343 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:17:46,343 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:17:46,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:17:46 BoogieIcfgContainer [2019-12-18 13:17:46,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:17:46,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:17:46,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:17:46,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:17:46,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:17:44" (1/3) ... [2019-12-18 13:17:46,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9a86b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:17:46, skipping insertion in model container [2019-12-18 13:17:46,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:45" (2/3) ... [2019-12-18 13:17:46,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9a86b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:17:46, skipping insertion in model container [2019-12-18 13:17:46,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:17:46" (3/3) ... [2019-12-18 13:17:46,357 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-12-18 13:17:46,368 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:17:46,368 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:17:46,380 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:17:46,381 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:17:46,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,503 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:46,523 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:17:46,556 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:17:46,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:17:46,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:17:46,557 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:17:46,557 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:17:46,557 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:17:46,557 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:17:46,558 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:17:46,574 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 13:17:46,576 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 13:17:46,646 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 13:17:46,647 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:17:46,663 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 13:17:46,680 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 13:17:46,729 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 13:17:46,730 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:17:46,742 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 13:17:46,761 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 13:17:46,763 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:17:51,550 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 13:17:51,690 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 13:17:51,845 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45287 [2019-12-18 13:17:51,845 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-18 13:17:51,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 80 transitions [2019-12-18 13:17:52,168 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-18 13:17:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-18 13:17:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:17:52,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:52,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:17:52,178 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash 679710407, now seen corresponding path program 1 times [2019-12-18 13:17:52,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:52,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648998515] [2019-12-18 13:17:52,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:52,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648998515] [2019-12-18 13:17:52,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:52,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:17:52,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853057906] [2019-12-18 13:17:52,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:52,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:52,532 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-18 13:17:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:52,792 INFO L93 Difference]: Finished difference Result 6414 states and 21820 transitions. [2019-12-18 13:17:52,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:52,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:17:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:52,869 INFO L225 Difference]: With dead ends: 6414 [2019-12-18 13:17:52,869 INFO L226 Difference]: Without dead ends: 6042 [2019-12-18 13:17:52,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-18 13:17:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-18 13:17:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-18 13:17:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20517 transitions. [2019-12-18 13:17:53,416 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20517 transitions. Word has length 5 [2019-12-18 13:17:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:53,416 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20517 transitions. [2019-12-18 13:17:53,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20517 transitions. [2019-12-18 13:17:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:17:53,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:53,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:53,427 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:53,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash 200851233, now seen corresponding path program 1 times [2019-12-18 13:17:53,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:53,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473213976] [2019-12-18 13:17:53,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:53,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473213976] [2019-12-18 13:17:53,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:53,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:53,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700257133] [2019-12-18 13:17:53,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:53,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:53,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:53,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:53,519 INFO L87 Difference]: Start difference. First operand 6042 states and 20517 transitions. Second operand 3 states. [2019-12-18 13:17:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:53,550 INFO L93 Difference]: Finished difference Result 1215 states and 3038 transitions. [2019-12-18 13:17:53,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:53,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 13:17:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:53,558 INFO L225 Difference]: With dead ends: 1215 [2019-12-18 13:17:53,559 INFO L226 Difference]: Without dead ends: 1215 [2019-12-18 13:17:53,560 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-18 13:17:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-18 13:17:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-18 13:17:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-18 13:17:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3038 transitions. [2019-12-18 13:17:53,594 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3038 transitions. Word has length 11 [2019-12-18 13:17:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:53,594 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3038 transitions. [2019-12-18 13:17:53,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3038 transitions. [2019-12-18 13:17:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:17:53,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:53,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:53,597 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1157318615, now seen corresponding path program 1 times [2019-12-18 13:17:53,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:53,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420088877] [2019-12-18 13:17:53,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:53,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420088877] [2019-12-18 13:17:53,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:53,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:53,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052569824] [2019-12-18 13:17:53,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:53,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:53,643 INFO L87 Difference]: Start difference. First operand 1215 states and 3038 transitions. Second operand 3 states. [2019-12-18 13:17:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:53,717 INFO L93 Difference]: Finished difference Result 1816 states and 4607 transitions. [2019-12-18 13:17:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:53,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 13:17:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:53,729 INFO L225 Difference]: With dead ends: 1816 [2019-12-18 13:17:53,729 INFO L226 Difference]: Without dead ends: 1816 [2019-12-18 13:17:53,730 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-18 13:17:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-18 13:17:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1358. [2019-12-18 13:17:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-12-18 13:17:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 3466 transitions. [2019-12-18 13:17:53,774 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 3466 transitions. Word has length 14 [2019-12-18 13:17:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:53,774 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 3466 transitions. [2019-12-18 13:17:53,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 3466 transitions. [2019-12-18 13:17:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:17:53,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:53,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:53,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1294893453, now seen corresponding path program 1 times [2019-12-18 13:17:53,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:53,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413786265] [2019-12-18 13:17:53,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:53,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413786265] [2019-12-18 13:17:53,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:53,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:53,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123668000] [2019-12-18 13:17:53,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:53,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:53,847 INFO L87 Difference]: Start difference. First operand 1358 states and 3466 transitions. Second operand 4 states. [2019-12-18 13:17:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:54,056 INFO L93 Difference]: Finished difference Result 1779 states and 4379 transitions. [2019-12-18 13:17:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:54,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:17:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:54,068 INFO L225 Difference]: With dead ends: 1779 [2019-12-18 13:17:54,069 INFO L226 Difference]: Without dead ends: 1779 [2019-12-18 13:17:54,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-18 13:17:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1647. [2019-12-18 13:17:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-18 13:17:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 4084 transitions. [2019-12-18 13:17:54,115 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 4084 transitions. Word has length 14 [2019-12-18 13:17:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:54,116 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 4084 transitions. [2019-12-18 13:17:54,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 4084 transitions. [2019-12-18 13:17:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:17:54,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:54,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:54,117 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1889466766, now seen corresponding path program 1 times [2019-12-18 13:17:54,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:54,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295617910] [2019-12-18 13:17:54,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:54,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295617910] [2019-12-18 13:17:54,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:54,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:54,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077693631] [2019-12-18 13:17:54,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:54,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:54,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:54,207 INFO L87 Difference]: Start difference. First operand 1647 states and 4084 transitions. Second operand 4 states. [2019-12-18 13:17:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:54,386 INFO L93 Difference]: Finished difference Result 2092 states and 5077 transitions. [2019-12-18 13:17:54,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:54,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:17:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:54,444 INFO L225 Difference]: With dead ends: 2092 [2019-12-18 13:17:54,445 INFO L226 Difference]: Without dead ends: 2092 [2019-12-18 13:17:54,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2019-12-18 13:17:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1708. [2019-12-18 13:17:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-12-18 13:17:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 4235 transitions. [2019-12-18 13:17:54,497 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 4235 transitions. Word has length 14 [2019-12-18 13:17:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:54,498 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 4235 transitions. [2019-12-18 13:17:54,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 4235 transitions. [2019-12-18 13:17:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:17:54,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:54,501 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-18 13:17:54,501 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2125431703, now seen corresponding path program 1 times [2019-12-18 13:17:54,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:54,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187841983] [2019-12-18 13:17:54,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:54,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187841983] [2019-12-18 13:17:54,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:54,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:17:54,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827531476] [2019-12-18 13:17:54,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:17:54,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:17:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:54,631 INFO L87 Difference]: Start difference. First operand 1708 states and 4235 transitions. Second operand 5 states. [2019-12-18 13:17:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:55,117 INFO L93 Difference]: Finished difference Result 2525 states and 6119 transitions. [2019-12-18 13:17:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:17:55,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:17:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:55,143 INFO L225 Difference]: With dead ends: 2525 [2019-12-18 13:17:55,143 INFO L226 Difference]: Without dead ends: 2525 [2019-12-18 13:17:55,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:17:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2019-12-18 13:17:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2074. [2019-12-18 13:17:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-18 13:17:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 5075 transitions. [2019-12-18 13:17:55,207 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 5075 transitions. Word has length 26 [2019-12-18 13:17:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:55,207 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 5075 transitions. [2019-12-18 13:17:55,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:17:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 5075 transitions. [2019-12-18 13:17:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:17:55,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:55,211 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-18 13:17:55,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2116463787, now seen corresponding path program 1 times [2019-12-18 13:17:55,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:55,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094370604] [2019-12-18 13:17:55,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:55,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094370604] [2019-12-18 13:17:55,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:55,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:55,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567714383] [2019-12-18 13:17:55,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:55,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:55,284 INFO L87 Difference]: Start difference. First operand 2074 states and 5075 transitions. Second operand 3 states. [2019-12-18 13:17:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:55,342 INFO L93 Difference]: Finished difference Result 2628 states and 6059 transitions. [2019-12-18 13:17:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:55,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 13:17:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:55,362 INFO L225 Difference]: With dead ends: 2628 [2019-12-18 13:17:55,362 INFO L226 Difference]: Without dead ends: 2628 [2019-12-18 13:17:55,363 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-18 13:17:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2019-12-18 13:17:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 1998. [2019-12-18 13:17:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 13:17:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4533 transitions. [2019-12-18 13:17:55,433 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4533 transitions. Word has length 26 [2019-12-18 13:17:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:55,433 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4533 transitions. [2019-12-18 13:17:55,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4533 transitions. [2019-12-18 13:17:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:17:55,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:55,437 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-18 13:17:55,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:55,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 474142059, now seen corresponding path program 1 times [2019-12-18 13:17:55,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:55,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117428085] [2019-12-18 13:17:55,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:55,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117428085] [2019-12-18 13:17:55,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:55,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:55,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266594860] [2019-12-18 13:17:55,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:55,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:55,511 INFO L87 Difference]: Start difference. First operand 1998 states and 4533 transitions. Second operand 4 states. [2019-12-18 13:17:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:55,532 INFO L93 Difference]: Finished difference Result 1020 states and 2119 transitions. [2019-12-18 13:17:55,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:55,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 13:17:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:55,536 INFO L225 Difference]: With dead ends: 1020 [2019-12-18 13:17:55,536 INFO L226 Difference]: Without dead ends: 1020 [2019-12-18 13:17:55,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-18 13:17:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 916. [2019-12-18 13:17:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-12-18 13:17:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1920 transitions. [2019-12-18 13:17:55,559 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1920 transitions. Word has length 26 [2019-12-18 13:17:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:55,559 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1920 transitions. [2019-12-18 13:17:55,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1920 transitions. [2019-12-18 13:17:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:17:55,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:55,562 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] [2019-12-18 13:17:55,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:55,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1317237189, now seen corresponding path program 1 times [2019-12-18 13:17:55,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:55,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340670866] [2019-12-18 13:17:55,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:55,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340670866] [2019-12-18 13:17:55,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:55,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:55,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084314866] [2019-12-18 13:17:55,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:55,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:55,638 INFO L87 Difference]: Start difference. First operand 916 states and 1920 transitions. Second operand 7 states. [2019-12-18 13:17:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:55,918 INFO L93 Difference]: Finished difference Result 2427 states and 4936 transitions. [2019-12-18 13:17:55,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:17:55,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 13:17:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:55,923 INFO L225 Difference]: With dead ends: 2427 [2019-12-18 13:17:55,924 INFO L226 Difference]: Without dead ends: 1586 [2019-12-18 13:17:55,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:17:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-18 13:17:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 999. [2019-12-18 13:17:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-18 13:17:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2081 transitions. [2019-12-18 13:17:55,993 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2081 transitions. Word has length 41 [2019-12-18 13:17:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:55,995 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2081 transitions. [2019-12-18 13:17:55,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2081 transitions. [2019-12-18 13:17:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:17:55,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:55,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:55,999 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:55,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2142063769, now seen corresponding path program 2 times [2019-12-18 13:17:56,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:56,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367774723] [2019-12-18 13:17:56,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:56,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367774723] [2019-12-18 13:17:56,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:56,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:56,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908681560] [2019-12-18 13:17:56,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:56,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:56,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:56,101 INFO L87 Difference]: Start difference. First operand 999 states and 2081 transitions. Second operand 4 states. [2019-12-18 13:17:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:56,122 INFO L93 Difference]: Finished difference Result 1698 states and 3532 transitions. [2019-12-18 13:17:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:56,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 13:17:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:56,125 INFO L225 Difference]: With dead ends: 1698 [2019-12-18 13:17:56,125 INFO L226 Difference]: Without dead ends: 727 [2019-12-18 13:17:56,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-12-18 13:17:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-12-18 13:17:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-12-18 13:17:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1499 transitions. [2019-12-18 13:17:56,142 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1499 transitions. Word has length 41 [2019-12-18 13:17:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:56,142 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1499 transitions. [2019-12-18 13:17:56,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1499 transitions. [2019-12-18 13:17:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:17:56,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:56,145 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] [2019-12-18 13:17:56,145 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash 845117651, now seen corresponding path program 3 times [2019-12-18 13:17:56,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:56,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720551969] [2019-12-18 13:17:56,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:56,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720551969] [2019-12-18 13:17:56,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:56,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:56,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107056574] [2019-12-18 13:17:56,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:56,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:56,218 INFO L87 Difference]: Start difference. First operand 727 states and 1499 transitions. Second operand 7 states. [2019-12-18 13:17:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:56,390 INFO L93 Difference]: Finished difference Result 1196 states and 2405 transitions. [2019-12-18 13:17:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:17:56,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 13:17:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:56,393 INFO L225 Difference]: With dead ends: 1196 [2019-12-18 13:17:56,393 INFO L226 Difference]: Without dead ends: 768 [2019-12-18 13:17:56,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-18 13:17:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2019-12-18 13:17:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-18 13:17:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1473 transitions. [2019-12-18 13:17:56,410 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1473 transitions. Word has length 41 [2019-12-18 13:17:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:56,410 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1473 transitions. [2019-12-18 13:17:56,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1473 transitions. [2019-12-18 13:17:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:17:56,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:56,413 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] [2019-12-18 13:17:56,413 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash -624248203, now seen corresponding path program 4 times [2019-12-18 13:17:56,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:56,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396324927] [2019-12-18 13:17:56,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:56,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396324927] [2019-12-18 13:17:56,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:56,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:56,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330350789] [2019-12-18 13:17:56,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:17:56,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:56,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:17:56,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:17:56,536 INFO L87 Difference]: Start difference. First operand 715 states and 1473 transitions. Second operand 6 states. [2019-12-18 13:17:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:56,911 INFO L93 Difference]: Finished difference Result 840 states and 1706 transitions. [2019-12-18 13:17:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:17:56,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 13:17:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:56,917 INFO L225 Difference]: With dead ends: 840 [2019-12-18 13:17:56,917 INFO L226 Difference]: Without dead ends: 840 [2019-12-18 13:17:56,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:17:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-12-18 13:17:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 745. [2019-12-18 13:17:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-18 13:17:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1528 transitions. [2019-12-18 13:17:56,935 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1528 transitions. Word has length 41 [2019-12-18 13:17:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:56,935 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1528 transitions. [2019-12-18 13:17:56,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:17:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1528 transitions. [2019-12-18 13:17:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:17:56,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:56,938 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] [2019-12-18 13:17:56,938 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash -723073613, now seen corresponding path program 5 times [2019-12-18 13:17:56,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:56,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258458308] [2019-12-18 13:17:56,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:57,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258458308] [2019-12-18 13:17:57,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:57,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:57,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386691632] [2019-12-18 13:17:57,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:57,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:57,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:57,010 INFO L87 Difference]: Start difference. First operand 745 states and 1528 transitions. Second operand 3 states. [2019-12-18 13:17:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:57,023 INFO L93 Difference]: Finished difference Result 743 states and 1523 transitions. [2019-12-18 13:17:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:57,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 13:17:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:57,025 INFO L225 Difference]: With dead ends: 743 [2019-12-18 13:17:57,025 INFO L226 Difference]: Without dead ends: 743 [2019-12-18 13:17:57,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-18 13:17:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 607. [2019-12-18 13:17:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-18 13:17:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1271 transitions. [2019-12-18 13:17:57,043 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1271 transitions. Word has length 41 [2019-12-18 13:17:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:57,043 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1271 transitions. [2019-12-18 13:17:57,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1271 transitions. [2019-12-18 13:17:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:17:57,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:57,045 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] [2019-12-18 13:17:57,046 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash 416077471, now seen corresponding path program 1 times [2019-12-18 13:17:57,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:57,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735289029] [2019-12-18 13:17:57,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:57,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:17:57,163 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:17:57,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$w_buff1~0_306) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t903~0.base_31|) (= 0 v_~__unbuffered_p1_EBX~0_149) (= v_~z~0_67 0) (= 0 v_~__unbuffered_cnt~0_92) (= 0 |v_ULTIMATE.start_main_~#t903~0.offset_23|) (= 0 v_~x$r_buff1_thd2~0_200) (= (select .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31|) 0) (= v_~x$r_buff1_thd0~0_197 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31|) |v_ULTIMATE.start_main_~#t903~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t903~0.base_31| 4) |v_#length_17|) (= 0 v_~x$read_delayed~0_6) (= v_~x$flush_delayed~0_43 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= v_~weak$$choice2~0_165 0) (= v_~x$r_buff0_thd1~0_354 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_271) (= 0 v_~x~0_132) (= 0 v_~x$w_buff0~0_467) (= v_~x$mem_tmp~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31| 1) |v_#valid_54|) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_51) (= 0 v_~x$w_buff1_used~0_505) (= v_~__unbuffered_p1_EAX~0_149 0) (= v_~y~0_138 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0_used~0_795))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_467, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_43, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_28|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_149, ULTIMATE.start_main_~#t903~0.offset=|v_ULTIMATE.start_main_~#t903~0.offset_23|, #length=|v_#length_17|, ~y~0=v_~y~0_138, ULTIMATE.start_main_~#t903~0.base=|v_ULTIMATE.start_main_~#t903~0.base_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_60|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~z~0=v_~z~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t904~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t903~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t903~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:17:57,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12|) |v_ULTIMATE.start_main_~#t904~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t904~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t904~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t904~0.base_12| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t904~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_12|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.base, ULTIMATE.start_main_~#t904~0.offset, #length] because there is no mapped edge [2019-12-18 13:17:57,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~x$w_buff0~0_50 v_~x$w_buff1~0_30) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= 1 v_~x$w_buff0_used~0_94) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= 1 v_~x$w_buff0~0_49) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_95) (= (mod v_~x$w_buff1_used~0_53 256) 0) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_23, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, ~x$w_buff1~0=v_~x$w_buff1~0_30, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 13:17:57,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1995383800 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1995383800 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1995383800 |P1Thread1of1ForFork0_#t~ite28_Out1995383800|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1995383800|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1995383800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1995383800} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1995383800, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1995383800|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1995383800} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 13:17:57,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1253347612 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1253347612 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1253347612 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1253347612 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out1253347612| 0)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1253347612| ~x$w_buff1_used~0_In1253347612) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1253347612, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1253347612, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1253347612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1253347612} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1253347612, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1253347612, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1253347612, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1253347612|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1253347612} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 13:17:57,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-594638865 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-594638865 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-594638865) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-594638865 ~x$r_buff0_thd2~0_Out-594638865) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-594638865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-594638865} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-594638865|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-594638865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-594638865} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 13:17:57,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In444474176 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In444474176 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In444474176 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In444474176 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out444474176|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In444474176 |P1Thread1of1ForFork0_#t~ite31_Out444474176|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In444474176, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In444474176, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In444474176, ~x$w_buff0_used~0=~x$w_buff0_used~0_In444474176} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out444474176|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In444474176, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In444474176, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In444474176, ~x$w_buff0_used~0=~x$w_buff0_used~0_In444474176} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:17:57,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_114 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:17:57,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_67 v_~x$r_buff0_thd1~0_66)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 13:17:57,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= v_~x$mem_tmp~0_6 v_~x~0_51) (not (= 0 (mod v_~x$flush_delayed~0_22 256))) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35) (= v_~x$flush_delayed~0_21 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 13:17:57,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:17:57,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1295813185 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1295813185 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out-1295813185| ~x$w_buff1~0_In-1295813185) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-1295813185 |ULTIMATE.start_main_#t~ite34_Out-1295813185|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1295813185, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1295813185, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1295813185, ~x~0=~x~0_In-1295813185} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1295813185, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1295813185, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1295813185, ~x~0=~x~0_In-1295813185, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1295813185|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 13:17:57,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 13:17:57,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-976362243 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-976362243 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-976362243|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-976362243| ~x$w_buff0_used~0_In-976362243) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-976362243, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-976362243} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-976362243, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-976362243|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-976362243} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 13:17:57,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1884903742 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1884903742 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1884903742 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1884903742 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out1884903742| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1884903742 |ULTIMATE.start_main_#t~ite37_Out1884903742|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1884903742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1884903742, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1884903742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1884903742} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1884903742, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1884903742, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1884903742|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1884903742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1884903742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:17:57,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In759642827 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In759642827 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out759642827| ~x$r_buff0_thd0~0_In759642827) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out759642827| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In759642827, ~x$w_buff0_used~0=~x$w_buff0_used~0_In759642827} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In759642827, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out759642827|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In759642827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:17:57,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1075989644 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1075989644 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1075989644 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1075989644 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out1075989644| ~x$r_buff1_thd0~0_In1075989644)) (and (= |ULTIMATE.start_main_#t~ite39_Out1075989644| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1075989644, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075989644, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1075989644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075989644} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1075989644, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1075989644|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075989644, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1075989644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1075989644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:17:57,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite39_36|) (= 0 v_~__unbuffered_p1_EBX~0_136) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EAX~0_136 1) (= 0 v_~__unbuffered_p0_EAX~0_38)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:17:57,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:17:57 BasicIcfg [2019-12-18 13:17:57,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:17:57,269 INFO L168 Benchmark]: Toolchain (without parser) took 12549.31 ms. Allocated memory was 139.5 MB in the beginning and 364.4 MB in the end (delta: 224.9 MB). Free memory was 103.0 MB in the beginning and 96.9 MB in the end (delta: 6.2 MB). Peak memory consumption was 231.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:57,270 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:17:57,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.49 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 159.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:57,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.79 ms. Allocated memory is still 203.9 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:57,274 INFO L168 Benchmark]: Boogie Preprocessor took 38.78 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 154.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:57,274 INFO L168 Benchmark]: RCFGBuilder took 721.30 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 113.3 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:57,275 INFO L168 Benchmark]: TraceAbstraction took 10920.58 ms. Allocated memory was 203.9 MB in the beginning and 364.4 MB in the end (delta: 160.4 MB). Free memory was 112.6 MB in the beginning and 96.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 176.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:57,285 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.49 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 159.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.79 ms. Allocated memory is still 203.9 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.78 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 154.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 721.30 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 113.3 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10920.58 ms. Allocated memory was 203.9 MB in the beginning and 364.4 MB in the end (delta: 160.4 MB). Free memory was 112.6 MB in the beginning and 96.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 176.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 80 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 18 ChoiceCompositions, 4487 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 190 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 45287 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x 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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__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=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1527 SDtfs, 1265 SDslu, 2941 SDs, 0 SdLazy, 1300 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred 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, 13 MinimizatonAttempts, 3030 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 32423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...