/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/mix040_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:27:56,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:27:56,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:27:56,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:27:56,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:27:56,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:27:56,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:27:56,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:27:56,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:27:56,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:27:56,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:27:56,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:27:56,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:27:56,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:27:56,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:27:56,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:27:56,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:27:56,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:27:56,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:27:56,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:27:56,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:27:56,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:27:56,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:27:56,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:27:56,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:27:56,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:27:56,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:27:56,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:27:56,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:27:56,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:27:56,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:27:56,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:27:56,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:27:56,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:27:56,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:27:56,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:27:56,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:27:56,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:27:56,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:27:56,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:27:56,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:27:56,553 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:27:56,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:27:56,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:27:56,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:27:56,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:27:56,568 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:27:56,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:27:56,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:27:56,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:27:56,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:27:56,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:27:56,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:27:56,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:27:56,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:27:56,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:27:56,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:27:56,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:27:56,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:27:56,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:27:56,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:27:56,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:27:56,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:27:56,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:27:56,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:27:56,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:27:56,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:27:56,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:27:56,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:27:56,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:27:56,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:27:56,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:27:56,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:27:56,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:27:56,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:27:56,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:27:56,890 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:27:56,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i [2019-12-18 13:27:56,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49cf24bd0/ace6bff902d64126a837fc692e7a712f/FLAG56ab66eba [2019-12-18 13:27:57,479 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:27:57,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i [2019-12-18 13:27:57,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49cf24bd0/ace6bff902d64126a837fc692e7a712f/FLAG56ab66eba [2019-12-18 13:27:57,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49cf24bd0/ace6bff902d64126a837fc692e7a712f [2019-12-18 13:27:57,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:27:57,798 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:27:57,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:27:57,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:27:57,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:27:57,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:27:57" (1/1) ... [2019-12-18 13:27:57,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10591731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:57, skipping insertion in model container [2019-12-18 13:27:57,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:27:57" (1/1) ... [2019-12-18 13:27:57,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:27:57,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:27:58,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:27:58,385 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:27:58,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:27:58,554 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:27:58,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58 WrapperNode [2019-12-18 13:27:58,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:27:58,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:27:58,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:27:58,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:27:58,565 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:27:58" (1/1) ... [2019-12-18 13:27:58,586 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:27:58" (1/1) ... [2019-12-18 13:27:58,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:27:58,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:27:58,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:27:58,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:27:58,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (1/1) ... [2019-12-18 13:27:58,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (1/1) ... [2019-12-18 13:27:58,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (1/1) ... [2019-12-18 13:27:58,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (1/1) ... [2019-12-18 13:27:58,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (1/1) ... [2019-12-18 13:27:58,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (1/1) ... [2019-12-18 13:27:58,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (1/1) ... [2019-12-18 13:27:58,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:27:58,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:27:58,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:27:58,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:27:58,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (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:27:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:27:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:27:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:27:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:27:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:27:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:27:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:27:58,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:27:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:27:58,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:27:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:27:58,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:27:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:27:58,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:27:58,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:27:58,742 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:27:59,484 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:27:59,484 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:27:59,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:27:59 BoogieIcfgContainer [2019-12-18 13:27:59,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:27:59,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:27:59,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:27:59,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:27:59,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:27:57" (1/3) ... [2019-12-18 13:27:59,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fd0195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:27:59, skipping insertion in model container [2019-12-18 13:27:59,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:27:58" (2/3) ... [2019-12-18 13:27:59,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fd0195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:27:59, skipping insertion in model container [2019-12-18 13:27:59,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:27:59" (3/3) ... [2019-12-18 13:27:59,494 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_rmo.opt.i [2019-12-18 13:27:59,505 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:27:59,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:27:59,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:27:59,514 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:27:59,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,591 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,591 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,591 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,592 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,592 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,618 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,618 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,632 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,634 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,634 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:27:59,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:27:59,679 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:27:59,679 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:27:59,679 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:27:59,680 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:27:59,680 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:27:59,680 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:27:59,680 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:27:59,680 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:27:59,704 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-18 13:27:59,707 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-18 13:27:59,832 INFO L126 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-18 13:27:59,832 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:27:59,858 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:27:59,880 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-18 13:27:59,957 INFO L126 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-18 13:27:59,957 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:27:59,963 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:27:59,979 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 13:27:59,980 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:28:05,195 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:28:05,351 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:28:05,365 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-18 13:28:05,365 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-18 13:28:05,369 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-18 13:28:07,049 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-18 13:28:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-18 13:28:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:28:07,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:07,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:07,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-18 13:28:07,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:07,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402189952] [2019-12-18 13:28:07,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:28:07,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402189952] [2019-12-18 13:28:07,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:07,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:28:07,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984765575] [2019-12-18 13:28:07,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:28:07,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:07,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:28:07,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:28:07,400 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-18 13:28:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:08,813 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-18 13:28:08,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:28:08,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:28:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:09,036 INFO L225 Difference]: With dead ends: 26518 [2019-12-18 13:28:09,036 INFO L226 Difference]: Without dead ends: 24958 [2019-12-18 13:28:09,038 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:28:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-18 13:28:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-18 13:28:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-18 13:28:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-18 13:28:10,353 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-18 13:28:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:10,354 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-18 13:28:10,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:28:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-18 13:28:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:28:10,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:10,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:10,362 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-18 13:28:10,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:10,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434609212] [2019-12-18 13:28:10,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:10,437 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:28:10,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434609212] [2019-12-18 13:28:10,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:10,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:28:10,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029777756] [2019-12-18 13:28:10,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:28:10,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:28:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:28:10,442 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 3 states. [2019-12-18 13:28:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:10,757 INFO L93 Difference]: Finished difference Result 19953 states and 78654 transitions. [2019-12-18 13:28:10,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:28:10,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:28:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:10,864 INFO L225 Difference]: With dead ends: 19953 [2019-12-18 13:28:10,865 INFO L226 Difference]: Without dead ends: 19953 [2019-12-18 13:28:10,866 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:28:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-18 13:28:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19953. [2019-12-18 13:28:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-12-18 13:28:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 78654 transitions. [2019-12-18 13:28:12,940 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 78654 transitions. Word has length 15 [2019-12-18 13:28:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:12,941 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 78654 transitions. [2019-12-18 13:28:12,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:28:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 78654 transitions. [2019-12-18 13:28:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:28:12,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:12,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:12,945 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 832904726, now seen corresponding path program 1 times [2019-12-18 13:28:12,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:12,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902463217] [2019-12-18 13:28:12,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:13,040 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:28:13,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902463217] [2019-12-18 13:28:13,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:13,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:28:13,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787365794] [2019-12-18 13:28:13,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:28:13,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:13,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:28:13,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:28:13,045 INFO L87 Difference]: Start difference. First operand 19953 states and 78654 transitions. Second operand 4 states. [2019-12-18 13:28:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:13,137 INFO L93 Difference]: Finished difference Result 9211 states and 30743 transitions. [2019-12-18 13:28:13,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:28:13,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:28:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:13,166 INFO L225 Difference]: With dead ends: 9211 [2019-12-18 13:28:13,166 INFO L226 Difference]: Without dead ends: 9211 [2019-12-18 13:28:13,167 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:28:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2019-12-18 13:28:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9211. [2019-12-18 13:28:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-12-18 13:28:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 30743 transitions. [2019-12-18 13:28:13,604 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 30743 transitions. Word has length 16 [2019-12-18 13:28:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:13,605 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 30743 transitions. [2019-12-18 13:28:13,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:28:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 30743 transitions. [2019-12-18 13:28:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:28:13,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:13,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:13,607 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1159456736, now seen corresponding path program 1 times [2019-12-18 13:28:13,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:13,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883008234] [2019-12-18 13:28:13,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:13,705 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:28:13,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883008234] [2019-12-18 13:28:13,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:13,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:28:13,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020424233] [2019-12-18 13:28:13,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:28:13,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:13,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:28:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:28:13,707 INFO L87 Difference]: Start difference. First operand 9211 states and 30743 transitions. Second operand 5 states. [2019-12-18 13:28:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:13,780 INFO L93 Difference]: Finished difference Result 2716 states and 8200 transitions. [2019-12-18 13:28:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:28:13,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:28:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:13,789 INFO L225 Difference]: With dead ends: 2716 [2019-12-18 13:28:13,789 INFO L226 Difference]: Without dead ends: 2716 [2019-12-18 13:28:13,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:28:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-18 13:28:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-18 13:28:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-18 13:28:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8200 transitions. [2019-12-18 13:28:13,844 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8200 transitions. Word has length 17 [2019-12-18 13:28:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:13,844 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8200 transitions. [2019-12-18 13:28:13,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:28:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8200 transitions. [2019-12-18 13:28:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 13:28:13,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:13,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:13,847 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-18 13:28:13,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:13,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242073033] [2019-12-18 13:28:13,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:13,957 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:28:13,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242073033] [2019-12-18 13:28:13,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:13,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:28:13,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949891755] [2019-12-18 13:28:13,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:28:13,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:28:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:28:13,960 INFO L87 Difference]: Start difference. First operand 2716 states and 8200 transitions. Second operand 4 states. [2019-12-18 13:28:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:14,154 INFO L93 Difference]: Finished difference Result 3607 states and 10783 transitions. [2019-12-18 13:28:14,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:28:14,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 13:28:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:14,163 INFO L225 Difference]: With dead ends: 3607 [2019-12-18 13:28:14,164 INFO L226 Difference]: Without dead ends: 3607 [2019-12-18 13:28:14,164 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:28:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-18 13:28:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3415. [2019-12-18 13:28:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-12-18 13:28:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 10347 transitions. [2019-12-18 13:28:14,251 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 10347 transitions. Word has length 18 [2019-12-18 13:28:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:14,251 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 10347 transitions. [2019-12-18 13:28:14,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:28:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 10347 transitions. [2019-12-18 13:28:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:28:14,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:14,262 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] [2019-12-18 13:28:14,262 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash -792380239, now seen corresponding path program 1 times [2019-12-18 13:28:14,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:14,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067163154] [2019-12-18 13:28:14,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:14,366 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:28:14,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067163154] [2019-12-18 13:28:14,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:14,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:28:14,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511169564] [2019-12-18 13:28:14,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:28:14,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:28:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:28:14,368 INFO L87 Difference]: Start difference. First operand 3415 states and 10347 transitions. Second operand 3 states. [2019-12-18 13:28:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:14,399 INFO L93 Difference]: Finished difference Result 5436 states and 15699 transitions. [2019-12-18 13:28:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:28:14,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 13:28:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:14,411 INFO L225 Difference]: With dead ends: 5436 [2019-12-18 13:28:14,411 INFO L226 Difference]: Without dead ends: 3574 [2019-12-18 13:28:14,411 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:28:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-18 13:28:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3488. [2019-12-18 13:28:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-12-18 13:28:14,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 9360 transitions. [2019-12-18 13:28:14,494 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 9360 transitions. Word has length 32 [2019-12-18 13:28:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:14,494 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 9360 transitions. [2019-12-18 13:28:14,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:28:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 9360 transitions. [2019-12-18 13:28:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:28:14,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:14,502 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] [2019-12-18 13:28:14,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:14,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-18 13:28:14,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:14,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552857140] [2019-12-18 13:28:14,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:14,566 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:28:14,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552857140] [2019-12-18 13:28:14,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:14,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:28:14,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512571195] [2019-12-18 13:28:14,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:28:14,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:14,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:28:14,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:28:14,569 INFO L87 Difference]: Start difference. First operand 3488 states and 9360 transitions. Second operand 3 states. [2019-12-18 13:28:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:14,625 INFO L93 Difference]: Finished difference Result 5140 states and 13647 transitions. [2019-12-18 13:28:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:28:14,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 13:28:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:14,635 INFO L225 Difference]: With dead ends: 5140 [2019-12-18 13:28:14,636 INFO L226 Difference]: Without dead ends: 5140 [2019-12-18 13:28:14,637 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:28:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-18 13:28:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4152. [2019-12-18 13:28:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2019-12-18 13:28:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 11165 transitions. [2019-12-18 13:28:14,719 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 11165 transitions. Word has length 32 [2019-12-18 13:28:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:14,719 INFO L462 AbstractCegarLoop]: Abstraction has 4152 states and 11165 transitions. [2019-12-18 13:28:14,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:28:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 11165 transitions. [2019-12-18 13:28:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:28:14,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:14,733 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] [2019-12-18 13:28:14,733 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-18 13:28:14,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:14,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025447982] [2019-12-18 13:28:14,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:14,792 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:28:14,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025447982] [2019-12-18 13:28:14,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:14,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:28:14,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932887424] [2019-12-18 13:28:14,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:28:14,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:28:14,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:28:14,796 INFO L87 Difference]: Start difference. First operand 4152 states and 11165 transitions. Second operand 3 states. [2019-12-18 13:28:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:14,846 INFO L93 Difference]: Finished difference Result 5140 states and 13308 transitions. [2019-12-18 13:28:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:28:14,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 13:28:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:14,858 INFO L225 Difference]: With dead ends: 5140 [2019-12-18 13:28:14,858 INFO L226 Difference]: Without dead ends: 5140 [2019-12-18 13:28:14,859 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:28:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-18 13:28:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4108. [2019-12-18 13:28:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4108 states. [2019-12-18 13:28:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 10730 transitions. [2019-12-18 13:28:15,084 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 10730 transitions. Word has length 32 [2019-12-18 13:28:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:15,085 INFO L462 AbstractCegarLoop]: Abstraction has 4108 states and 10730 transitions. [2019-12-18 13:28:15,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:28:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 10730 transitions. [2019-12-18 13:28:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:28:15,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:15,095 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] [2019-12-18 13:28:15,095 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-18 13:28:15,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:15,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93485590] [2019-12-18 13:28:15,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:15,159 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:28:15,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93485590] [2019-12-18 13:28:15,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:15,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:28:15,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817479406] [2019-12-18 13:28:15,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:28:15,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:15,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:28:15,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:28:15,161 INFO L87 Difference]: Start difference. First operand 4108 states and 10730 transitions. Second operand 6 states. [2019-12-18 13:28:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:15,219 INFO L93 Difference]: Finished difference Result 3096 states and 8255 transitions. [2019-12-18 13:28:15,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:28:15,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 13:28:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:15,222 INFO L225 Difference]: With dead ends: 3096 [2019-12-18 13:28:15,222 INFO L226 Difference]: Without dead ends: 1590 [2019-12-18 13:28:15,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:28:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-18 13:28:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1480. [2019-12-18 13:28:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-12-18 13:28:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 3877 transitions. [2019-12-18 13:28:15,247 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 3877 transitions. Word has length 32 [2019-12-18 13:28:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:15,248 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 3877 transitions. [2019-12-18 13:28:15,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:28:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 3877 transitions. [2019-12-18 13:28:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:28:15,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:15,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:15,252 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1467210822, now seen corresponding path program 1 times [2019-12-18 13:28:15,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:15,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952846963] [2019-12-18 13:28:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:15,322 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:28:15,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952846963] [2019-12-18 13:28:15,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:15,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:28:15,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377778291] [2019-12-18 13:28:15,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:28:15,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:15,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:28:15,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:28:15,325 INFO L87 Difference]: Start difference. First operand 1480 states and 3877 transitions. Second operand 3 states. [2019-12-18 13:28:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:15,346 INFO L93 Difference]: Finished difference Result 2211 states and 5434 transitions. [2019-12-18 13:28:15,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:28:15,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 13:28:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:15,348 INFO L225 Difference]: With dead ends: 2211 [2019-12-18 13:28:15,348 INFO L226 Difference]: Without dead ends: 775 [2019-12-18 13:28:15,348 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:28:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-18 13:28:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2019-12-18 13:28:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-12-18 13:28:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1640 transitions. [2019-12-18 13:28:15,361 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1640 transitions. Word has length 47 [2019-12-18 13:28:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:15,361 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1640 transitions. [2019-12-18 13:28:15,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:28:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1640 transitions. [2019-12-18 13:28:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:28:15,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:15,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:15,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1384248998, now seen corresponding path program 2 times [2019-12-18 13:28:15,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:15,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116815472] [2019-12-18 13:28:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:15,480 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:28:15,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116815472] [2019-12-18 13:28:15,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:15,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:28:15,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233803389] [2019-12-18 13:28:15,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:28:15,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:28:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:28:15,483 INFO L87 Difference]: Start difference. First operand 775 states and 1640 transitions. Second operand 7 states. [2019-12-18 13:28:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:15,747 INFO L93 Difference]: Finished difference Result 1953 states and 4058 transitions. [2019-12-18 13:28:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:28:15,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 13:28:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:15,749 INFO L225 Difference]: With dead ends: 1953 [2019-12-18 13:28:15,749 INFO L226 Difference]: Without dead ends: 1317 [2019-12-18 13:28:15,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:28:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-12-18 13:28:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 878. [2019-12-18 13:28:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-18 13:28:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1848 transitions. [2019-12-18 13:28:15,764 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1848 transitions. Word has length 47 [2019-12-18 13:28:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:15,764 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1848 transitions. [2019-12-18 13:28:15,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:28:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1848 transitions. [2019-12-18 13:28:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:28:15,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:15,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:15,769 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash -801480632, now seen corresponding path program 3 times [2019-12-18 13:28:15,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:15,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938790479] [2019-12-18 13:28:15,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:15,833 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:28:15,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938790479] [2019-12-18 13:28:15,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:15,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:28:15,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412077902] [2019-12-18 13:28:15,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:28:15,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:28:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:28:15,835 INFO L87 Difference]: Start difference. First operand 878 states and 1848 transitions. Second operand 4 states. [2019-12-18 13:28:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:15,855 INFO L93 Difference]: Finished difference Result 1419 states and 2990 transitions. [2019-12-18 13:28:15,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:28:15,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 13:28:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:15,857 INFO L225 Difference]: With dead ends: 1419 [2019-12-18 13:28:15,857 INFO L226 Difference]: Without dead ends: 573 [2019-12-18 13:28:15,857 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:28:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-12-18 13:28:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-12-18 13:28:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-18 13:28:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1194 transitions. [2019-12-18 13:28:15,866 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1194 transitions. Word has length 47 [2019-12-18 13:28:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:15,866 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1194 transitions. [2019-12-18 13:28:15,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:28:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1194 transitions. [2019-12-18 13:28:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 13:28:15,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:15,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:15,869 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1009662868, now seen corresponding path program 4 times [2019-12-18 13:28:15,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:15,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909821014] [2019-12-18 13:28:15,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:28:15,940 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:28:15,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909821014] [2019-12-18 13:28:15,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:28:15,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:28:15,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927602453] [2019-12-18 13:28:15,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:28:15,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:28:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:28:15,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:28:15,942 INFO L87 Difference]: Start difference. First operand 573 states and 1194 transitions. Second operand 3 states. [2019-12-18 13:28:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:28:15,959 INFO L93 Difference]: Finished difference Result 571 states and 1189 transitions. [2019-12-18 13:28:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:28:15,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 13:28:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:28:15,961 INFO L225 Difference]: With dead ends: 571 [2019-12-18 13:28:15,961 INFO L226 Difference]: Without dead ends: 571 [2019-12-18 13:28:15,961 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:28:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-18 13:28:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-12-18 13:28:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-18 13:28:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1189 transitions. [2019-12-18 13:28:15,972 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1189 transitions. Word has length 47 [2019-12-18 13:28:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:28:15,972 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1189 transitions. [2019-12-18 13:28:15,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:28:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1189 transitions. [2019-12-18 13:28:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:28:15,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:28:15,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:28:15,974 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:28:15,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:28:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 1 times [2019-12-18 13:28:15,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:28:15,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205355261] [2019-12-18 13:28:15,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:28:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:28:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:28:16,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:28:16,121 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:28:16,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1077~0.base_46|) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46| 1)) (= 0 v_~z$r_buff1_thd4~0_128) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46|) |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0)) |v_#memory_int_25|) (= |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46|) 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1077~0.base_46| 4)) (= v_~__unbuffered_p3_EAX~0_105 0) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_45|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_29|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_26|, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1077~0.offset=|v_ULTIMATE.start_main_~#t1077~0.offset_30|, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_29|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_19|, ULTIMATE.start_main_~#t1077~0.base=|v_ULTIMATE.start_main_~#t1077~0.base_46|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1078~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1079~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1080~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t1077~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1079~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1078~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, ULTIMATE.start_main_~#t1077~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:28:16,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1078~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1078~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1078~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1078~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13|) |v_ULTIMATE.start_main_~#t1078~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1078~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1078~0.base] because there is no mapped edge [2019-12-18 13:28:16,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1079~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1079~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1079~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13|) |v_ULTIMATE.start_main_~#t1079~0.offset_11| 2)) |v_#memory_int_19|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1079~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1079~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:28:16,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1080~0.base_11| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t1080~0.offset_10|) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1080~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11|) |v_ULTIMATE.start_main_~#t1080~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1080~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, #length, ULTIMATE.start_main_~#t1080~0.base] because there is no mapped edge [2019-12-18 13:28:16,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10| 1) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (= v_P3Thread1of1ForFork1_~arg.base_10 |v_P3Thread1of1ForFork1_#in~arg.base_10|) (= (mod v_~z$w_buff1_used~0_69 256) 0) (= v_P3Thread1of1ForFork1_~arg.offset_10 |v_P3Thread1of1ForFork1_#in~arg.offset_10|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_10|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_10, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 13:28:16,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_18) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= v_P0Thread1of1ForFork2_~arg.base_18 |v_P0Thread1of1ForFork2_#in~arg.base_18|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_18, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_18} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 13:28:16,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_14) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_48 2) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_14) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_14, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_14, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-18 13:28:16,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In710616409 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite8_In710616409| |P2Thread1of1ForFork0_#t~ite8_Out710616409|) (= ~z$w_buff0~0_In710616409 |P2Thread1of1ForFork0_#t~ite9_Out710616409|)) (and (= ~z$w_buff0~0_In710616409 |P2Thread1of1ForFork0_#t~ite8_Out710616409|) (= |P2Thread1of1ForFork0_#t~ite9_Out710616409| |P2Thread1of1ForFork0_#t~ite8_Out710616409|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In710616409 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In710616409 256))) (= 0 (mod ~z$w_buff0_used~0_In710616409 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In710616409 256))))) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In710616409|, ~z$w_buff0~0=~z$w_buff0~0_In710616409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710616409, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In710616409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710616409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In710616409, ~weak$$choice2~0=~weak$$choice2~0_In710616409} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out710616409|, ~z$w_buff0~0=~z$w_buff0~0_In710616409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710616409, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In710616409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In710616409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In710616409, ~weak$$choice2~0=~weak$$choice2~0_In710616409, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out710616409|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 13:28:16,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1883510375 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out1883510375| ~z$w_buff1~0_In1883510375) (= |P2Thread1of1ForFork0_#t~ite11_Out1883510375| |P2Thread1of1ForFork0_#t~ite12_Out1883510375|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1883510375 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1883510375 256))) (= (mod ~z$w_buff0_used~0_In1883510375 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In1883510375 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out1883510375| ~z$w_buff1~0_In1883510375) (= |P2Thread1of1ForFork0_#t~ite11_In1883510375| |P2Thread1of1ForFork0_#t~ite11_Out1883510375|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1883510375, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1883510375|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1883510375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883510375, ~z$w_buff1~0=~z$w_buff1~0_In1883510375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1883510375, ~weak$$choice2~0=~weak$$choice2~0_In1883510375} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1883510375|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883510375, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1883510375|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1883510375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883510375, ~z$w_buff1~0=~z$w_buff1~0_In1883510375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1883510375, ~weak$$choice2~0=~weak$$choice2~0_In1883510375} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 13:28:16,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In900964093 256) 0))) (or (and (= ~z$w_buff0_used~0_In900964093 |P2Thread1of1ForFork0_#t~ite15_Out900964093|) (= |P2Thread1of1ForFork0_#t~ite14_In900964093| |P2Thread1of1ForFork0_#t~ite14_Out900964093|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite15_Out900964093| |P2Thread1of1ForFork0_#t~ite14_Out900964093|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In900964093 256) 0))) (or (= (mod ~z$w_buff0_used~0_In900964093 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In900964093 256))) (and (= (mod ~z$w_buff1_used~0_In900964093 256) 0) .cse1))) (= ~z$w_buff0_used~0_In900964093 |P2Thread1of1ForFork0_#t~ite14_Out900964093|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In900964093|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In900964093, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900964093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900964093, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900964093, ~weak$$choice2~0=~weak$$choice2~0_In900964093} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out900964093|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out900964093|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In900964093, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900964093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900964093, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900964093, ~weak$$choice2~0=~weak$$choice2~0_In900964093} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-18 13:28:16,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_11|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 13:28:16,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-416479989 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-416479989 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out-416479989| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out-416479989| ~z$w_buff0_used~0_In-416479989)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-416479989, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-416479989} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-416479989, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-416479989|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-416479989} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 13:28:16,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:28:16,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1970540513 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1970540513 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1970540513 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1970540513 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite29_Out1970540513| ~z$w_buff1_used~0_In1970540513) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out1970540513| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1970540513, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970540513, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1970540513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970540513} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1970540513, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1970540513|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970540513, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1970540513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1970540513} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 13:28:16,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1045722318 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1045722318 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1045722318) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_In-1045722318 ~z$r_buff0_thd4~0_Out-1045722318)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045722318, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1045722318} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045722318, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1045722318, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1045722318|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 13:28:16,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In1174141955 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1174141955 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1174141955 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1174141955 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out1174141955|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In1174141955 |P3Thread1of1ForFork1_#t~ite31_Out1174141955|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1174141955, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1174141955, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1174141955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1174141955} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1174141955, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1174141955, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1174141955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1174141955, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1174141955|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 13:28:16,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_60|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_60|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_59|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 13:28:16,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 4 v_~__unbuffered_cnt~0_60)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:28:16,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1658541329 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1658541329 256) 0))) (or (and (= ~z~0_In-1658541329 |ULTIMATE.start_main_#t~ite36_Out-1658541329|) (or .cse0 .cse1)) (and (not .cse0) (= ~z$w_buff1~0_In-1658541329 |ULTIMATE.start_main_#t~ite36_Out-1658541329|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1658541329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1658541329, ~z$w_buff1~0=~z$w_buff1~0_In-1658541329, ~z~0=~z~0_In-1658541329} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1658541329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1658541329, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1658541329|, ~z$w_buff1~0=~z$w_buff1~0_In-1658541329, ~z~0=~z~0_In-1658541329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 13:28:16,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-18 13:28:16,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1664297081 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1664297081 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1664297081 |ULTIMATE.start_main_#t~ite38_Out1664297081|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out1664297081|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1664297081, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1664297081} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1664297081, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1664297081, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1664297081|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:28:16,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1257558959 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1257558959 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1257558959 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1257558959 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1257558959| ~z$w_buff1_used~0_In1257558959) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1257558959| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1257558959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1257558959, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1257558959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1257558959} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1257558959, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1257558959|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1257558959, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1257558959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1257558959} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:28:16,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1097360324 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1097360324 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1097360324| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1097360324 |ULTIMATE.start_main_#t~ite40_Out-1097360324|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1097360324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097360324} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1097360324, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1097360324|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097360324} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:28:16,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-86201111 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-86201111 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-86201111 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-86201111 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-86201111| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-86201111| ~z$r_buff1_thd0~0_In-86201111)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-86201111, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-86201111, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-86201111, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-86201111} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-86201111|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-86201111, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-86201111, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-86201111, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-86201111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 13:28:16,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x~0_52 2) (= v_~main$tmp_guard1~0_23 0) (= v_~y~0_52 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:28:16,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:28:16 BasicIcfg [2019-12-18 13:28:16,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:28:16,262 INFO L168 Benchmark]: Toolchain (without parser) took 18464.32 ms. Allocated memory was 145.2 MB in the beginning and 985.7 MB in the end (delta: 840.4 MB). Free memory was 100.6 MB in the beginning and 388.3 MB in the end (delta: -287.6 MB). Peak memory consumption was 552.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:28:16,263 INFO L168 Benchmark]: CDTParser took 1.62 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 13:28:16,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.17 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 156.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:28:16,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:28:16,265 INFO L168 Benchmark]: Boogie Preprocessor took 55.46 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:28:16,266 INFO L168 Benchmark]: RCFGBuilder took 810.90 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 105.0 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:28:16,267 INFO L168 Benchmark]: TraceAbstraction took 16773.30 ms. Allocated memory was 202.4 MB in the beginning and 985.7 MB in the end (delta: 783.3 MB). Free memory was 105.0 MB in the beginning and 388.3 MB in the end (delta: -283.3 MB). Peak memory consumption was 500.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:28:16,271 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.17 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 156.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.46 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.90 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 105.0 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16773.30 ms. Allocated memory was 202.4 MB in the beginning and 985.7 MB in the end (delta: 783.3 MB). Free memory was 105.0 MB in the beginning and 388.3 MB in the end (delta: -283.3 MB). Peak memory consumption was 500.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1077, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1078, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1079, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1080, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1414 SDtfs, 1290 SDslu, 2116 SDs, 0 SdLazy, 446 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27254occurred 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: 4.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2847 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 34685 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...