/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/rfi004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:10:32,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:10:32,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:10:32,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:10:32,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:10:32,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:10:32,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:10:32,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:10:32,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:10:32,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:10:32,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:10:32,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:10:32,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:10:32,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:10:32,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:10:32,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:10:32,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:10:32,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:10:32,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:10:32,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:10:32,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:10:32,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:10:32,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:10:32,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:10:32,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:10:32,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:10:32,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:10:32,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:10:32,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:10:32,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:10:32,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:10:32,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:10:32,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:10:32,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:10:32,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:10:32,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:10:32,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:10:32,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:10:32,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:10:32,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:10:32,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:10:32,600 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 14:10:32,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:10:32,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:10:32,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:10:32,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:10:32,621 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:10:32,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:10:32,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:10:32,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:10:32,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:10:32,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:10:32,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:10:32,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:10:32,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:10:32,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:10:32,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:10:32,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:10:32,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:10:32,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:10:32,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:10:32,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:10:32,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:10:32,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:10:32,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:10:32,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:10:32,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:10:32,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:10:32,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:10:32,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:10:32,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:10:32,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:10:32,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:10:32,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:10:32,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:10:32,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:10:32,917 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:10:32,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-18 14:10:33,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91548bc24/270c369c20dd48649f68752768a5ab30/FLAG59e7d78cb [2019-12-18 14:10:33,607 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:10:33,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-18 14:10:33,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91548bc24/270c369c20dd48649f68752768a5ab30/FLAG59e7d78cb [2019-12-18 14:10:33,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91548bc24/270c369c20dd48649f68752768a5ab30 [2019-12-18 14:10:33,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:10:33,851 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:10:33,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:33,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:10:33,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:10:33,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:33" (1/1) ... [2019-12-18 14:10:33,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc0254b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:33, skipping insertion in model container [2019-12-18 14:10:33,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:33" (1/1) ... [2019-12-18 14:10:33,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:10:33,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:10:34,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:34,444 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:10:34,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:34,588 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:10:34,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34 WrapperNode [2019-12-18 14:10:34,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:34,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:34,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:10:34,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:10:34,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:34,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:10:34,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:10:34,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:10:34,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (1/1) ... [2019-12-18 14:10:34,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:10:34,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:10:34,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:10:34,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:10:34,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (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 14:10:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:10:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:10:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:10:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:10:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:10:34,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:10:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:10:34,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:10:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:10:34,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:10:34,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:10:34,761 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 14:10:35,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:10:35,457 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:10:35,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:35 BoogieIcfgContainer [2019-12-18 14:10:35,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:10:35,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:10:35,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:10:35,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:10:35,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:10:33" (1/3) ... [2019-12-18 14:10:35,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165304ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:35, skipping insertion in model container [2019-12-18 14:10:35,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:34" (2/3) ... [2019-12-18 14:10:35,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165304ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:35, skipping insertion in model container [2019-12-18 14:10:35,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:35" (3/3) ... [2019-12-18 14:10:35,468 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i [2019-12-18 14:10:35,479 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:10:35,479 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:10:35,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:10:35,488 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:10:35,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,552 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,552 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,552 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,553 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,571 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:35,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:10:35,621 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:10:35,621 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:10:35,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:10:35,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:10:35,622 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:10:35,622 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:10:35,622 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:10:35,622 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:10:35,646 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 14:10:35,648 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 14:10:35,752 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 14:10:35,752 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:35,767 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:35,783 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 14:10:35,818 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 14:10:35,819 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:35,829 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:35,843 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 14:10:35,844 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:10:40,477 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:10:40,619 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:10:40,676 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-18 14:10:40,677 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-18 14:10:40,681 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-18 14:10:41,046 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-18 14:10:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-18 14:10:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:10:41,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:41,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:10:41,057 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-18 14:10:41,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:41,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314087673] [2019-12-18 14:10:41,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:41,285 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 14:10:41,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314087673] [2019-12-18 14:10:41,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:41,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:10:41,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749451302] [2019-12-18 14:10:41,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:41,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:41,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:41,309 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-18 14:10:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:41,568 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-18 14:10:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:41,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:10:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:41,670 INFO L225 Difference]: With dead ends: 6636 [2019-12-18 14:10:41,670 INFO L226 Difference]: Without dead ends: 6246 [2019-12-18 14:10:41,672 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 14:10:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-18 14:10:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-18 14:10:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-18 14:10:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-18 14:10:42,079 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-18 14:10:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:42,079 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-18 14:10:42,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-18 14:10:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:10:42,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:42,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:42,084 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-18 14:10:42,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:42,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123565737] [2019-12-18 14:10:42,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:42,238 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 14:10:42,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123565737] [2019-12-18 14:10:42,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:42,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:42,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199193526] [2019-12-18 14:10:42,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:42,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:42,245 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-18 14:10:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:42,344 INFO L93 Difference]: Finished difference Result 1666 states and 4431 transitions. [2019-12-18 14:10:42,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:10:42,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:10:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:42,356 INFO L225 Difference]: With dead ends: 1666 [2019-12-18 14:10:42,357 INFO L226 Difference]: Without dead ends: 1276 [2019-12-18 14:10:42,359 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 14:10:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-12-18 14:10:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-12-18 14:10:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-12-18 14:10:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3147 transitions. [2019-12-18 14:10:42,398 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3147 transitions. Word has length 11 [2019-12-18 14:10:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:42,398 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3147 transitions. [2019-12-18 14:10:42,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3147 transitions. [2019-12-18 14:10:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:42,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:42,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:42,404 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-18 14:10:42,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:42,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321191297] [2019-12-18 14:10:42,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:42,499 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 14:10:42,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321191297] [2019-12-18 14:10:42,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:42,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:42,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308006852] [2019-12-18 14:10:42,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:42,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:42,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:42,502 INFO L87 Difference]: Start difference. First operand 1276 states and 3147 transitions. Second operand 3 states. [2019-12-18 14:10:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:42,575 INFO L93 Difference]: Finished difference Result 1986 states and 4934 transitions. [2019-12-18 14:10:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:42,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:10:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:42,590 INFO L225 Difference]: With dead ends: 1986 [2019-12-18 14:10:42,590 INFO L226 Difference]: Without dead ends: 1986 [2019-12-18 14:10:42,591 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 14:10:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-12-18 14:10:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1490. [2019-12-18 14:10:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-12-18 14:10:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 3702 transitions. [2019-12-18 14:10:42,647 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 3702 transitions. Word has length 14 [2019-12-18 14:10:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:42,648 INFO L462 AbstractCegarLoop]: Abstraction has 1490 states and 3702 transitions. [2019-12-18 14:10:42,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 3702 transitions. [2019-12-18 14:10:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:42,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:42,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:42,651 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-18 14:10:42,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:42,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714847004] [2019-12-18 14:10:42,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:42,722 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 14:10:42,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714847004] [2019-12-18 14:10:42,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:42,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:42,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146406624] [2019-12-18 14:10:42,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:42,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:42,728 INFO L87 Difference]: Start difference. First operand 1490 states and 3702 transitions. Second operand 4 states. [2019-12-18 14:10:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:42,910 INFO L93 Difference]: Finished difference Result 1934 states and 4662 transitions. [2019-12-18 14:10:42,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:42,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:10:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:42,924 INFO L225 Difference]: With dead ends: 1934 [2019-12-18 14:10:42,924 INFO L226 Difference]: Without dead ends: 1919 [2019-12-18 14:10:42,925 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 14:10:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-12-18 14:10:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1755. [2019-12-18 14:10:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-18 14:10:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 4270 transitions. [2019-12-18 14:10:42,997 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 4270 transitions. Word has length 14 [2019-12-18 14:10:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:42,997 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 4270 transitions. [2019-12-18 14:10:42,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 4270 transitions. [2019-12-18 14:10:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:42,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:42,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:43,000 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-18 14:10:43,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:43,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796209941] [2019-12-18 14:10:43,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:43,080 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 14:10:43,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796209941] [2019-12-18 14:10:43,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:43,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:43,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495875784] [2019-12-18 14:10:43,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:43,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:43,082 INFO L87 Difference]: Start difference. First operand 1755 states and 4270 transitions. Second operand 4 states. [2019-12-18 14:10:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:43,232 INFO L93 Difference]: Finished difference Result 2157 states and 5151 transitions. [2019-12-18 14:10:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:43,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:10:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:43,245 INFO L225 Difference]: With dead ends: 2157 [2019-12-18 14:10:43,245 INFO L226 Difference]: Without dead ends: 2136 [2019-12-18 14:10:43,246 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 14:10:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-12-18 14:10:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1779. [2019-12-18 14:10:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-12-18 14:10:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 4301 transitions. [2019-12-18 14:10:43,334 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 4301 transitions. Word has length 14 [2019-12-18 14:10:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:43,334 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 4301 transitions. [2019-12-18 14:10:43,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 4301 transitions. [2019-12-18 14:10:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:10:43,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:43,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:43,338 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-18 14:10:43,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:43,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467097591] [2019-12-18 14:10:43,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:43,418 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 14:10:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467097591] [2019-12-18 14:10:43,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:43,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:43,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764200838] [2019-12-18 14:10:43,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:43,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:43,420 INFO L87 Difference]: Start difference. First operand 1779 states and 4301 transitions. Second operand 5 states. [2019-12-18 14:10:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:43,665 INFO L93 Difference]: Finished difference Result 2379 states and 5678 transitions. [2019-12-18 14:10:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:10:43,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:10:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:43,686 INFO L225 Difference]: With dead ends: 2379 [2019-12-18 14:10:43,687 INFO L226 Difference]: Without dead ends: 2377 [2019-12-18 14:10:43,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-18 14:10:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1893. [2019-12-18 14:10:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-12-18 14:10:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 4570 transitions. [2019-12-18 14:10:43,744 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 4570 transitions. Word has length 26 [2019-12-18 14:10:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:43,745 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 4570 transitions. [2019-12-18 14:10:43,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 4570 transitions. [2019-12-18 14:10:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:10:43,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:43,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:43,749 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:43,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:43,750 INFO L82 PathProgramCache]: Analyzing trace with hash -673024853, now seen corresponding path program 1 times [2019-12-18 14:10:43,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:43,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366216261] [2019-12-18 14:10:43,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:43,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366216261] [2019-12-18 14:10:43,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:43,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:10:43,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087187360] [2019-12-18 14:10:43,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:43,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:43,889 INFO L87 Difference]: Start difference. First operand 1893 states and 4570 transitions. Second operand 5 states. [2019-12-18 14:10:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:44,282 INFO L93 Difference]: Finished difference Result 2701 states and 6403 transitions. [2019-12-18 14:10:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:10:44,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:10:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:44,290 INFO L225 Difference]: With dead ends: 2701 [2019-12-18 14:10:44,291 INFO L226 Difference]: Without dead ends: 2701 [2019-12-18 14:10:44,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:10:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-12-18 14:10:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2281. [2019-12-18 14:10:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-12-18 14:10:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5445 transitions. [2019-12-18 14:10:44,349 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5445 transitions. Word has length 26 [2019-12-18 14:10:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:44,349 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 5445 transitions. [2019-12-18 14:10:44,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5445 transitions. [2019-12-18 14:10:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:10:44,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:44,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:44,354 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:44,355 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-12-18 14:10:44,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:44,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656416395] [2019-12-18 14:10:44,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:44,455 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 14:10:44,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656416395] [2019-12-18 14:10:44,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:44,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:44,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280331676] [2019-12-18 14:10:44,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:44,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:44,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:44,459 INFO L87 Difference]: Start difference. First operand 2281 states and 5445 transitions. Second operand 5 states. [2019-12-18 14:10:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:44,642 INFO L93 Difference]: Finished difference Result 2800 states and 6613 transitions. [2019-12-18 14:10:44,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:10:44,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:10:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:44,651 INFO L225 Difference]: With dead ends: 2800 [2019-12-18 14:10:44,651 INFO L226 Difference]: Without dead ends: 2798 [2019-12-18 14:10:44,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2019-12-18 14:10:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2217. [2019-12-18 14:10:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-18 14:10:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 5286 transitions. [2019-12-18 14:10:44,705 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 5286 transitions. Word has length 27 [2019-12-18 14:10:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:44,706 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 5286 transitions. [2019-12-18 14:10:44,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 5286 transitions. [2019-12-18 14:10:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:10:44,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:44,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:44,711 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-12-18 14:10:44,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:44,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736224341] [2019-12-18 14:10:44,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:44,851 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 14:10:44,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736224341] [2019-12-18 14:10:44,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:44,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:10:44,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094382268] [2019-12-18 14:10:44,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:44,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:44,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:44,856 INFO L87 Difference]: Start difference. First operand 2217 states and 5286 transitions. Second operand 5 states. [2019-12-18 14:10:44,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:44,921 INFO L93 Difference]: Finished difference Result 1251 states and 2791 transitions. [2019-12-18 14:10:44,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:44,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:10:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:44,925 INFO L225 Difference]: With dead ends: 1251 [2019-12-18 14:10:44,925 INFO L226 Difference]: Without dead ends: 1109 [2019-12-18 14:10:44,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-12-18 14:10:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 989. [2019-12-18 14:10:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-12-18 14:10:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2218 transitions. [2019-12-18 14:10:44,953 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2218 transitions. Word has length 27 [2019-12-18 14:10:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:44,953 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 2218 transitions. [2019-12-18 14:10:44,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2218 transitions. [2019-12-18 14:10:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:44,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:44,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:44,957 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1687726867, now seen corresponding path program 1 times [2019-12-18 14:10:44,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:44,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634469215] [2019-12-18 14:10:44,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,024 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 14:10:45,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634469215] [2019-12-18 14:10:45,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:10:45,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285850031] [2019-12-18 14:10:45,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:10:45,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:10:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:10:45,026 INFO L87 Difference]: Start difference. First operand 989 states and 2218 transitions. Second operand 6 states. [2019-12-18 14:10:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:45,258 INFO L93 Difference]: Finished difference Result 2445 states and 5362 transitions. [2019-12-18 14:10:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:10:45,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:10:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:45,263 INFO L225 Difference]: With dead ends: 2445 [2019-12-18 14:10:45,264 INFO L226 Difference]: Without dead ends: 1624 [2019-12-18 14:10:45,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:10:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-18 14:10:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1064. [2019-12-18 14:10:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-12-18 14:10:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2384 transitions. [2019-12-18 14:10:45,292 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2384 transitions. Word has length 41 [2019-12-18 14:10:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:45,292 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 2384 transitions. [2019-12-18 14:10:45,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:10:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2384 transitions. [2019-12-18 14:10:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:45,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:45,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:45,296 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2071793039, now seen corresponding path program 2 times [2019-12-18 14:10:45,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:45,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397151461] [2019-12-18 14:10:45,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,358 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 14:10:45,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397151461] [2019-12-18 14:10:45,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:45,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663970116] [2019-12-18 14:10:45,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:45,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:45,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:45,361 INFO L87 Difference]: Start difference. First operand 1064 states and 2384 transitions. Second operand 4 states. [2019-12-18 14:10:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:45,380 INFO L93 Difference]: Finished difference Result 1833 states and 4110 transitions. [2019-12-18 14:10:45,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:10:45,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 14:10:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:45,383 INFO L225 Difference]: With dead ends: 1833 [2019-12-18 14:10:45,383 INFO L226 Difference]: Without dead ends: 797 [2019-12-18 14:10:45,383 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 14:10:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-18 14:10:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-12-18 14:10:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-18 14:10:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1774 transitions. [2019-12-18 14:10:45,399 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1774 transitions. Word has length 41 [2019-12-18 14:10:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:45,399 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1774 transitions. [2019-12-18 14:10:45,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1774 transitions. [2019-12-18 14:10:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:45,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:45,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:45,402 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:45,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1825813411, now seen corresponding path program 3 times [2019-12-18 14:10:45,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:45,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244143735] [2019-12-18 14:10:45,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,482 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 14:10:45,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244143735] [2019-12-18 14:10:45,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:10:45,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993995638] [2019-12-18 14:10:45,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:10:45,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:10:45,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:45,485 INFO L87 Difference]: Start difference. First operand 797 states and 1774 transitions. Second operand 7 states. [2019-12-18 14:10:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:45,662 INFO L93 Difference]: Finished difference Result 1250 states and 2717 transitions. [2019-12-18 14:10:45,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:10:45,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 14:10:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:45,665 INFO L225 Difference]: With dead ends: 1250 [2019-12-18 14:10:45,665 INFO L226 Difference]: Without dead ends: 829 [2019-12-18 14:10:45,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:10:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-12-18 14:10:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 785. [2019-12-18 14:10:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-12-18 14:10:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1748 transitions. [2019-12-18 14:10:45,681 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1748 transitions. Word has length 41 [2019-12-18 14:10:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:45,682 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1748 transitions. [2019-12-18 14:10:45,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:10:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1748 transitions. [2019-12-18 14:10:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:45,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:45,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:45,685 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1484678691, now seen corresponding path program 4 times [2019-12-18 14:10:45,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:45,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507018529] [2019-12-18 14:10:45,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,769 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 14:10:45,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507018529] [2019-12-18 14:10:45,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:10:45,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337249685] [2019-12-18 14:10:45,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:10:45,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:10:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:10:45,772 INFO L87 Difference]: Start difference. First operand 785 states and 1748 transitions. Second operand 6 states. [2019-12-18 14:10:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:46,127 INFO L93 Difference]: Finished difference Result 908 states and 1993 transitions. [2019-12-18 14:10:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:10:46,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:10:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:46,131 INFO L225 Difference]: With dead ends: 908 [2019-12-18 14:10:46,132 INFO L226 Difference]: Without dead ends: 908 [2019-12-18 14:10:46,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:10:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-18 14:10:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 791. [2019-12-18 14:10:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-18 14:10:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1759 transitions. [2019-12-18 14:10:46,186 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1759 transitions. Word has length 41 [2019-12-18 14:10:46,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:46,186 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1759 transitions. [2019-12-18 14:10:46,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:10:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1759 transitions. [2019-12-18 14:10:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:46,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:46,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:46,192 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:46,193 INFO L82 PathProgramCache]: Analyzing trace with hash 577447219, now seen corresponding path program 5 times [2019-12-18 14:10:46,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:46,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176819299] [2019-12-18 14:10:46,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:46,248 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 14:10:46,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176819299] [2019-12-18 14:10:46,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:46,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:46,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71219865] [2019-12-18 14:10:46,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:46,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:46,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:46,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:46,251 INFO L87 Difference]: Start difference. First operand 791 states and 1759 transitions. Second operand 3 states. [2019-12-18 14:10:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:46,268 INFO L93 Difference]: Finished difference Result 789 states and 1754 transitions. [2019-12-18 14:10:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:46,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:10:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:46,271 INFO L225 Difference]: With dead ends: 789 [2019-12-18 14:10:46,271 INFO L226 Difference]: Without dead ends: 789 [2019-12-18 14:10:46,272 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 14:10:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-18 14:10:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 697. [2019-12-18 14:10:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-18 14:10:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1570 transitions. [2019-12-18 14:10:46,290 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1570 transitions. Word has length 41 [2019-12-18 14:10:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:46,290 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1570 transitions. [2019-12-18 14:10:46,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1570 transitions. [2019-12-18 14:10:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:10:46,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:46,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:46,294 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 1 times [2019-12-18 14:10:46,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:46,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061932181] [2019-12-18 14:10:46,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:10:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:10:46,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:10:46,396 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:10:46,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1653~0.base_19| 4)) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) (= v_~y$r_buff0_thd0~0_127 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19|) 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) |v_ULTIMATE.start_main_~#t1653~0.offset_17| 0)) |v_#memory_int_11|) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0) (= 0 |v_ULTIMATE.start_main_~#t1653~0.offset_17|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ULTIMATE.start_main_~#t1653~0.offset=|v_ULTIMATE.start_main_~#t1653~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_22|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1653~0.base=|v_ULTIMATE.start_main_~#t1653~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1654~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ULTIMATE.start_main_~#t1653~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1654~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1653~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:10:46,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1654~0.base_9| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1654~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9|) |v_ULTIMATE.start_main_~#t1654~0.offset_8| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1654~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1654~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1654~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1654~0.base] because there is no mapped edge [2019-12-18 14:10:46,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76 0)) (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:10:46,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-826458682 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-826458682 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-826458682|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-826458682 |P1Thread1of1ForFork0_#t~ite28_Out-826458682|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-826458682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-826458682} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-826458682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-826458682, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-826458682|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:10:46,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In368663668 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In368663668 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In368663668 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In368663668 256) 0))) (or (and (= ~y$w_buff1_used~0_In368663668 |P1Thread1of1ForFork0_#t~ite29_Out368663668|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out368663668|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In368663668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In368663668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In368663668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In368663668} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In368663668, ~y$w_buff0_used~0=~y$w_buff0_used~0_In368663668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In368663668, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out368663668|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In368663668} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:10:46,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1547227998 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1547227998 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out1547227998 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_Out1547227998 ~y$r_buff0_thd2~0_In1547227998)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1547227998, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1547227998} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1547227998, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1547227998|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1547227998} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:10:46,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2140872448 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2140872448 256)))) (or (and (= (mod ~y$r_buff1_thd1~0_In-2140872448 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In-2140872448 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-2140872448 256) 0))) (= |P0Thread1of1ForFork1_#t~ite17_Out-2140872448| ~y$w_buff1_used~0_In-2140872448) (= |P0Thread1of1ForFork1_#t~ite18_Out-2140872448| |P0Thread1of1ForFork1_#t~ite17_Out-2140872448|) .cse1) (and (= |P0Thread1of1ForFork1_#t~ite17_In-2140872448| |P0Thread1of1ForFork1_#t~ite17_Out-2140872448|) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite18_Out-2140872448| ~y$w_buff1_used~0_In-2140872448)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2140872448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140872448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2140872448, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-2140872448|, ~weak$$choice2~0=~weak$$choice2~0_In-2140872448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140872448} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2140872448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140872448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2140872448, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-2140872448|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-2140872448|, ~weak$$choice2~0=~weak$$choice2~0_In-2140872448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140872448} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 14:10:46,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_14|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:10:46,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 14:10:46,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-506614302 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-506614302 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-506614302 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-506614302 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-506614302|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-506614302 |P1Thread1of1ForFork0_#t~ite31_Out-506614302|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-506614302, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-506614302, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-506614302, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-506614302} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-506614302, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-506614302, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-506614302|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-506614302, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-506614302} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:10:46,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_34| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:10:46,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:10:46,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1881212368 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1881212368 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In1881212368 |ULTIMATE.start_main_#t~ite34_Out1881212368|) (not .cse1)) (and (= ~y~0_In1881212368 |ULTIMATE.start_main_#t~ite34_Out1881212368|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1881212368, ~y~0=~y~0_In1881212368, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1881212368, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1881212368} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1881212368, ~y~0=~y~0_In1881212368, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1881212368, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1881212368|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1881212368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 14:10:46,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 14:10:46,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-119231570 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-119231570 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-119231570| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-119231570| ~y$w_buff0_used~0_In-119231570) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-119231570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-119231570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-119231570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-119231570, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-119231570|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 14:10:46,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-2053882761 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-2053882761 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2053882761 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2053882761 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2053882761 |ULTIMATE.start_main_#t~ite37_Out-2053882761|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite37_Out-2053882761|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2053882761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2053882761, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2053882761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2053882761} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2053882761, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2053882761, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2053882761|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2053882761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2053882761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 14:10:46,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In826085764 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In826085764 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out826085764|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In826085764 |ULTIMATE.start_main_#t~ite38_Out826085764|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In826085764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In826085764} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In826085764, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In826085764, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out826085764|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 14:10:46,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1009058056 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1009058056 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1009058056 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1009058056 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1009058056 |ULTIMATE.start_main_#t~ite39_Out-1009058056|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1009058056|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009058056, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1009058056, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1009058056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1009058056} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1009058056, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1009058056|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1009058056, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1009058056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1009058056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 14:10:46,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:10:46,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:10:46 BasicIcfg [2019-12-18 14:10:46,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:10:46,493 INFO L168 Benchmark]: Toolchain (without parser) took 12643.28 ms. Allocated memory was 146.8 MB in the beginning and 422.1 MB in the end (delta: 275.3 MB). Free memory was 103.0 MB in the beginning and 302.6 MB in the end (delta: -199.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,494 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:10:46,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.36 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 159.6 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.82 ms. Allocated memory is still 204.5 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,497 INFO L168 Benchmark]: Boogie Preprocessor took 33.78 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,497 INFO L168 Benchmark]: RCFGBuilder took 768.87 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 113.7 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,498 INFO L168 Benchmark]: TraceAbstraction took 11031.95 ms. Allocated memory was 204.5 MB in the beginning and 422.1 MB in the end (delta: 217.6 MB). Free memory was 113.1 MB in the beginning and 302.6 MB in the end (delta: -189.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,503 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.36 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 159.6 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.82 ms. Allocated memory is still 204.5 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.78 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 768.87 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 113.7 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11031.95 ms. Allocated memory was 204.5 MB in the beginning and 422.1 MB in the end (delta: 217.6 MB). Free memory was 113.1 MB in the beginning and 302.6 MB in the end (delta: -189.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1737 SDtfs, 1540 SDslu, 3255 SDs, 0 SdLazy, 1514 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6812occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 3435 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 32471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...