/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:22:28,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:22:28,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:22:28,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:22:28,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:22:28,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:22:28,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:22:28,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:22:28,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:22:28,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:22:28,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:22:28,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:22:28,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:22:28,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:22:28,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:22:28,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:22:28,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:22:28,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:22:28,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:22:28,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:22:28,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:22:28,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:22:28,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:22:28,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:22:28,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:22:28,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:22:28,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:22:28,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:22:28,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:22:28,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:22:28,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:22:28,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:22:28,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:22:28,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:22:28,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:22:28,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:22:28,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:22:28,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:22:28,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:22:28,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:22:28,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:22:28,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:22:28,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:22:28,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:22:28,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:22:28,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:22:28,567 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:22:28,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:22:28,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:22:28,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:22:28,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:22:28,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:22:28,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:22:28,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:22:28,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:22:28,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:22:28,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:22:28,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:22:28,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:22:28,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:22:28,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:22:28,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:22:28,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:22:28,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:22:28,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:22:28,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:22:28,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:22:28,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:22:28,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:22:28,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:22:28,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:22:28,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:22:28,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:22:28,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:22:28,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:22:28,857 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:22:28,858 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-27 01:22:28,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee0c59fb/c1cce571f220427eaac64676b581fef4/FLAG7355d2d53 [2019-12-27 01:22:29,500 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:22:29,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-27 01:22:29,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee0c59fb/c1cce571f220427eaac64676b581fef4/FLAG7355d2d53 [2019-12-27 01:22:29,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cee0c59fb/c1cce571f220427eaac64676b581fef4 [2019-12-27 01:22:29,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:22:29,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:22:29,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:22:29,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:22:29,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:22:29,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:22:29" (1/1) ... [2019-12-27 01:22:29,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6248610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:29, skipping insertion in model container [2019-12-27 01:22:29,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:22:29" (1/1) ... [2019-12-27 01:22:29,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:22:29,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:22:30,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:22:30,429 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:22:30,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:22:30,574 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:22:30,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30 WrapperNode [2019-12-27 01:22:30,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:22:30,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:22:30,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:22:30,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:22:30,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:22:30,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:22:30,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:22:30,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:22:30,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... [2019-12-27 01:22:30,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:22:30,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:22:30,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:22:30,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:22:30,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:22:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:22:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:22:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:22:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:22:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:22:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:22:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:22:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:22:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:22:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:22:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:22:30,768 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:22:31,483 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:22:31,484 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:22:31,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:22:31 BoogieIcfgContainer [2019-12-27 01:22:31,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:22:31,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:22:31,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:22:31,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:22:31,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:22:29" (1/3) ... [2019-12-27 01:22:31,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48205fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:22:31, skipping insertion in model container [2019-12-27 01:22:31,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:22:30" (2/3) ... [2019-12-27 01:22:31,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48205fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:22:31, skipping insertion in model container [2019-12-27 01:22:31,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:22:31" (3/3) ... [2019-12-27 01:22:31,498 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc.i [2019-12-27 01:22:31,509 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:22:31,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:22:31,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:22:31,521 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:22:31,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:22:31,698 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:22:31,719 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:22:31,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:22:31,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:22:31,719 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:22:31,720 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:22:31,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:22:31,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:22:31,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:22:31,741 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-27 01:22:31,743 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-27 01:22:31,838 INFO L132 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-27 01:22:31,838 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:22:31,851 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:22:31,870 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-27 01:22:31,914 INFO L132 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-27 01:22:31,915 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:22:31,921 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:22:31,934 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 01:22:31,936 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:22:37,057 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 01:22:37,166 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 01:22:37,191 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-12-27 01:22:37,191 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 01:22:37,195 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-27 01:22:37,637 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 01:22:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 01:22:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:22:37,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:37,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:22:37,647 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-12-27 01:22:37,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:37,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498190749] [2019-12-27 01:22:37,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:37,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498190749] [2019-12-27 01:22:37,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:37,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:22:37,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985602633] [2019-12-27 01:22:37,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:22:37,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:37,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:22:37,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:37,884 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 01:22:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:38,228 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-27 01:22:38,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:22:38,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:22:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:38,325 INFO L225 Difference]: With dead ends: 8466 [2019-12-27 01:22:38,325 INFO L226 Difference]: Without dead ends: 7974 [2019-12-27 01:22:38,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-27 01:22:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-27 01:22:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-27 01:22:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-27 01:22:38,744 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-27 01:22:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:38,744 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-27 01:22:38,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:22:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-27 01:22:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:22:38,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:38,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:38,748 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-12-27 01:22:38,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:38,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595337648] [2019-12-27 01:22:38,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:38,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595337648] [2019-12-27 01:22:38,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:38,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:22:38,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921367712] [2019-12-27 01:22:38,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:22:38,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:22:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:38,848 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-12-27 01:22:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:38,879 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-12-27 01:22:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:22:38,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 01:22:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:38,887 INFO L225 Difference]: With dead ends: 1283 [2019-12-27 01:22:38,887 INFO L226 Difference]: Without dead ends: 1283 [2019-12-27 01:22:38,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-27 01:22:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-27 01:22:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-27 01:22:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-12-27 01:22:38,920 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-12-27 01:22:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:38,921 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-12-27 01:22:38,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:22:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-12-27 01:22:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:22:38,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:38,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:38,923 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:38,923 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-12-27 01:22:38,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:38,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859160341] [2019-12-27 01:22:38,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:39,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859160341] [2019-12-27 01:22:39,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:39,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:22:39,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312883593] [2019-12-27 01:22:39,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:22:39,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:22:39,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:22:39,049 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-12-27 01:22:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:39,381 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-12-27 01:22:39,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:22:39,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 01:22:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:39,392 INFO L225 Difference]: With dead ends: 1902 [2019-12-27 01:22:39,393 INFO L226 Difference]: Without dead ends: 1902 [2019-12-27 01:22:39,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:22:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-27 01:22:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-12-27 01:22:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-27 01:22:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-12-27 01:22:39,483 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-12-27 01:22:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:39,484 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-12-27 01:22:39,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:22:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-12-27 01:22:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:22:39,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:39,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:39,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:39,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:39,489 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-12-27 01:22:39,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:39,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030773345] [2019-12-27 01:22:39,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:39,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030773345] [2019-12-27 01:22:39,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:39,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:22:39,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765219992] [2019-12-27 01:22:39,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:22:39,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:39,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:22:39,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:22:39,696 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-12-27 01:22:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:40,089 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-12-27 01:22:40,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:22:40,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 01:22:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:40,102 INFO L225 Difference]: With dead ends: 2385 [2019-12-27 01:22:40,102 INFO L226 Difference]: Without dead ends: 2385 [2019-12-27 01:22:40,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:22:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-27 01:22:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-12-27 01:22:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-12-27 01:22:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-12-27 01:22:40,150 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-12-27 01:22:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:40,151 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-12-27 01:22:40,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:22:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-12-27 01:22:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:22:40,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:40,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:40,154 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1948393738, now seen corresponding path program 1 times [2019-12-27 01:22:40,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:40,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305073039] [2019-12-27 01:22:40,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:40,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305073039] [2019-12-27 01:22:40,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:40,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:22:40,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093549569] [2019-12-27 01:22:40,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:22:40,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:40,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:22:40,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:40,285 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 3 states. [2019-12-27 01:22:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:40,300 INFO L93 Difference]: Finished difference Result 1724 states and 3878 transitions. [2019-12-27 01:22:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:22:40,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 01:22:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:40,311 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 01:22:40,311 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 01:22:40,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 01:22:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2019-12-27 01:22:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-27 01:22:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3878 transitions. [2019-12-27 01:22:40,350 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3878 transitions. Word has length 26 [2019-12-27 01:22:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:40,351 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3878 transitions. [2019-12-27 01:22:40,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:22:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3878 transitions. [2019-12-27 01:22:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:22:40,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:40,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-27 01:22:40,354 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash -50148810, now seen corresponding path program 1 times [2019-12-27 01:22:40,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:40,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23431383] [2019-12-27 01:22:40,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:40,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23431383] [2019-12-27 01:22:40,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:40,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:22:40,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453616554] [2019-12-27 01:22:40,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:22:40,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:40,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:22:40,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:22:40,462 INFO L87 Difference]: Start difference. First operand 1724 states and 3878 transitions. Second operand 5 states. [2019-12-27 01:22:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:40,925 INFO L93 Difference]: Finished difference Result 2512 states and 5536 transitions. [2019-12-27 01:22:40,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:22:40,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:22:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:40,941 INFO L225 Difference]: With dead ends: 2512 [2019-12-27 01:22:40,941 INFO L226 Difference]: Without dead ends: 2512 [2019-12-27 01:22:40,942 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-27 01:22:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-27 01:22:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2217. [2019-12-27 01:22:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-27 01:22:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-12-27 01:22:40,993 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-12-27 01:22:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:40,994 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-12-27 01:22:40,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:22:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-12-27 01:22:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:22:40,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:40,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:40,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-12-27 01:22:40,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:40,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660364356] [2019-12-27 01:22:40,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:41,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660364356] [2019-12-27 01:22:41,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:41,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:22:41,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208387871] [2019-12-27 01:22:41,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:22:41,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:22:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:22:41,053 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-12-27 01:22:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:41,076 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-12-27 01:22:41,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:22:41,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 01:22:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:41,094 INFO L225 Difference]: With dead ends: 1233 [2019-12-27 01:22:41,094 INFO L226 Difference]: Without dead ends: 1233 [2019-12-27 01:22:41,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:22:41,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-27 01:22:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-12-27 01:22:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-27 01:22:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-12-27 01:22:41,133 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-12-27 01:22:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:41,133 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-12-27 01:22:41,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:22:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-12-27 01:22:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:22:41,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:41,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:41,140 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2075557978, now seen corresponding path program 1 times [2019-12-27 01:22:41,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:41,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275680785] [2019-12-27 01:22:41,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:41,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275680785] [2019-12-27 01:22:41,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:41,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:22:41,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906670187] [2019-12-27 01:22:41,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:22:41,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:22:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:41,249 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-12-27 01:22:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:41,295 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-12-27 01:22:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:22:41,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 01:22:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:41,301 INFO L225 Difference]: With dead ends: 1748 [2019-12-27 01:22:41,301 INFO L226 Difference]: Without dead ends: 1748 [2019-12-27 01:22:41,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-27 01:22:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-12-27 01:22:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-12-27 01:22:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-12-27 01:22:41,332 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-12-27 01:22:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:41,333 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-12-27 01:22:41,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:22:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-12-27 01:22:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:22:41,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:41,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:41,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -175297467, now seen corresponding path program 1 times [2019-12-27 01:22:41,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:41,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712161613] [2019-12-27 01:22:41,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:41,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712161613] [2019-12-27 01:22:41,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:41,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:22:41,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525342224] [2019-12-27 01:22:41,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:22:41,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:22:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:22:41,465 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 7 states. [2019-12-27 01:22:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:41,804 INFO L93 Difference]: Finished difference Result 3420 states and 7139 transitions. [2019-12-27 01:22:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 01:22:41,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 01:22:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:41,812 INFO L225 Difference]: With dead ends: 3420 [2019-12-27 01:22:41,812 INFO L226 Difference]: Without dead ends: 2222 [2019-12-27 01:22:41,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:22:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-12-27 01:22:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1320. [2019-12-27 01:22:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-12-27 01:22:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2818 transitions. [2019-12-27 01:22:41,845 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2818 transitions. Word has length 51 [2019-12-27 01:22:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:41,846 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 2818 transitions. [2019-12-27 01:22:41,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:22:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2818 transitions. [2019-12-27 01:22:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:22:41,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:41,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:41,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:41,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash -128483093, now seen corresponding path program 2 times [2019-12-27 01:22:41,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:41,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449808841] [2019-12-27 01:22:41,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:22:41,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449808841] [2019-12-27 01:22:41,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:41,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:22:41,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347183978] [2019-12-27 01:22:41,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:22:41,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:41,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:22:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:41,953 INFO L87 Difference]: Start difference. First operand 1320 states and 2818 transitions. Second operand 3 states. [2019-12-27 01:22:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:41,968 INFO L93 Difference]: Finished difference Result 1319 states and 2816 transitions. [2019-12-27 01:22:41,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:22:41,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 01:22:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:41,973 INFO L225 Difference]: With dead ends: 1319 [2019-12-27 01:22:41,973 INFO L226 Difference]: Without dead ends: 1319 [2019-12-27 01:22:41,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-27 01:22:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1128. [2019-12-27 01:22:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-12-27 01:22:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2448 transitions. [2019-12-27 01:22:41,996 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2448 transitions. Word has length 51 [2019-12-27 01:22:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:41,996 INFO L462 AbstractCegarLoop]: Abstraction has 1128 states and 2448 transitions. [2019-12-27 01:22:41,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:22:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2448 transitions. [2019-12-27 01:22:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 01:22:42,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:42,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:42,000 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:42,000 INFO L82 PathProgramCache]: Analyzing trace with hash 529376956, now seen corresponding path program 1 times [2019-12-27 01:22:42,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:42,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445378773] [2019-12-27 01:22:42,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:22:42,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-27 01:22:42,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445378773] [2019-12-27 01:22:42,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:22:42,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:22:42,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802613726] [2019-12-27 01:22:42,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:22:42,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:22:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:22:42,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:42,083 INFO L87 Difference]: Start difference. First operand 1128 states and 2448 transitions. Second operand 3 states. [2019-12-27 01:22:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:22:42,146 INFO L93 Difference]: Finished difference Result 1374 states and 2961 transitions. [2019-12-27 01:22:42,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:22:42,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 01:22:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:22:42,150 INFO L225 Difference]: With dead ends: 1374 [2019-12-27 01:22:42,150 INFO L226 Difference]: Without dead ends: 1374 [2019-12-27 01:22:42,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:22:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-12-27 01:22:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1083. [2019-12-27 01:22:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-12-27 01:22:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2384 transitions. [2019-12-27 01:22:42,172 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2384 transitions. Word has length 52 [2019-12-27 01:22:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:22:42,173 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 2384 transitions. [2019-12-27 01:22:42,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:22:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2384 transitions. [2019-12-27 01:22:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:22:42,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:22:42,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:22:42,176 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:22:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:22:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 1 times [2019-12-27 01:22:42,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:22:42,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896137043] [2019-12-27 01:22:42,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:22:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:22:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:22:42,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:22:42,304 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:22:42,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t245~0.base_34|) (= v_~z$w_buff1~0_283 0) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34|)) (= v_~z$w_buff0~0_493 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t245~0.base_34| 4)) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t245~0.offset_22|) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34|) |v_ULTIMATE.start_main_~#t245~0.offset_22| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_48) (= (store .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34| 1) |v_#valid_57|) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t245~0.offset=|v_ULTIMATE.start_main_~#t245~0.offset_22|, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ULTIMATE.start_main_~#t245~0.base=|v_ULTIMATE.start_main_~#t245~0.base_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_21|, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t245~0.offset, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t245~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t246~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t246~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 01:22:42,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~z$r_buff1_thd0~0_Out1141454031 ~z$r_buff0_thd0~0_In1141454031) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1141454031 0)) (= ~z$r_buff0_thd2~0_In1141454031 ~z$r_buff1_thd2~0_Out1141454031) (= ~y~0_In1141454031 ~__unbuffered_p0_EBX~0_Out1141454031) (= ~x~0_Out1141454031 1) (= ~z$r_buff0_thd1~0_In1141454031 ~z$r_buff1_thd1~0_Out1141454031) (= ~x~0_Out1141454031 ~__unbuffered_p0_EAX~0_Out1141454031) (= ~z$r_buff0_thd1~0_Out1141454031 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1141454031, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1141454031, ~y~0=~y~0_In1141454031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1141454031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1141454031} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1141454031, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1141454031, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out1141454031, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1141454031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1141454031, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1141454031, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1141454031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1141454031, ~y~0=~y~0_In1141454031, ~x~0=~x~0_Out1141454031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1141454031} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 01:22:42,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) |v_ULTIMATE.start_main_~#t246~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t246~0.base_12|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t246~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t246~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_12|, #length=|v_#length_11|, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t246~0.base, #length, ULTIMATE.start_main_~#t246~0.offset] because there is no mapped edge [2019-12-27 01:22:42,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In87648497 256)))) (or (and (= ~z$w_buff0_used~0_In87648497 |P1Thread1of1ForFork1_#t~ite20_Out87648497|) (= |P1Thread1of1ForFork1_#t~ite21_Out87648497| |P1Thread1of1ForFork1_#t~ite20_Out87648497|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In87648497 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In87648497 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In87648497 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In87648497 256))))) (and (not .cse0) (= ~z$w_buff0_used~0_In87648497 |P1Thread1of1ForFork1_#t~ite21_Out87648497|) (= |P1Thread1of1ForFork1_#t~ite20_In87648497| |P1Thread1of1ForFork1_#t~ite20_Out87648497|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In87648497, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In87648497|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In87648497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In87648497, ~weak$$choice2~0=~weak$$choice2~0_In87648497, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In87648497} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In87648497, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out87648497|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In87648497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In87648497, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out87648497|, ~weak$$choice2~0=~weak$$choice2~0_In87648497, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In87648497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 01:22:42,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 01:22:42,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2111553503 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In2111553503| |P1Thread1of1ForFork1_#t~ite29_Out2111553503|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out2111553503| ~z$r_buff1_thd2~0_In2111553503)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out2111553503| |P1Thread1of1ForFork1_#t~ite29_Out2111553503|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In2111553503 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In2111553503 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In2111553503 256) 0)) (= (mod ~z$w_buff0_used~0_In2111553503 256) 0))) (= ~z$r_buff1_thd2~0_In2111553503 |P1Thread1of1ForFork1_#t~ite29_Out2111553503|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2111553503|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2111553503, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2111553503, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2111553503, ~weak$$choice2~0=~weak$$choice2~0_In2111553503, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2111553503} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2111553503|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2111553503|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2111553503, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2111553503, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2111553503, ~weak$$choice2~0=~weak$$choice2~0_In2111553503, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2111553503} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 01:22:42,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:22:42,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-1646426484| |P1Thread1of1ForFork1_#t~ite32_Out-1646426484|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1646426484 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1646426484 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1646426484 |P1Thread1of1ForFork1_#t~ite32_Out-1646426484|)) (and .cse0 (= ~z$w_buff1~0_In-1646426484 |P1Thread1of1ForFork1_#t~ite32_Out-1646426484|) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1646426484, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1646426484, ~z$w_buff1~0=~z$w_buff1~0_In-1646426484, ~z~0=~z~0_In-1646426484} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1646426484, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1646426484, ~z$w_buff1~0=~z$w_buff1~0_In-1646426484, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1646426484|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1646426484|, ~z~0=~z~0_In-1646426484} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 01:22:42,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1546272614 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1546272614 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1546272614| ~z$w_buff0_used~0_In1546272614) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1546272614| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1546272614, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1546272614} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1546272614, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1546272614|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1546272614} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 01:22:42,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1352035596 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1352035596 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1352035596 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1352035596 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1352035596| ~z$w_buff1_used~0_In-1352035596)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1352035596| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1352035596, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1352035596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1352035596, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1352035596} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1352035596, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1352035596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1352035596, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1352035596|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1352035596} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 01:22:42,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In302730509 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In302730509 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out302730509|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In302730509 |P1Thread1of1ForFork1_#t~ite36_Out302730509|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In302730509, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In302730509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In302730509, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In302730509, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out302730509|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 01:22:42,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-809658966 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-809658966 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-809658966| ~z$w_buff0_used~0_In-809658966)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-809658966| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-809658966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-809658966} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-809658966|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-809658966, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-809658966} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 01:22:42,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In874062502 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In874062502 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In874062502 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In874062502 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out874062502|)) (and (= ~z$w_buff1_used~0_In874062502 |P0Thread1of1ForFork0_#t~ite6_Out874062502|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In874062502, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In874062502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874062502, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In874062502} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out874062502|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In874062502, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In874062502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874062502, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In874062502} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 01:22:42,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-540129146 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-540129146 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-540129146 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-540129146 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-540129146| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-540129146| ~z$r_buff1_thd2~0_In-540129146) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-540129146, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-540129146, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540129146, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-540129146} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-540129146, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-540129146, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540129146, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-540129146, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-540129146|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:22:42,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_24|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:22:42,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1739227604 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1739227604 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1739227604) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1739227604 ~z$r_buff0_thd1~0_Out-1739227604)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739227604, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1739227604} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1739227604, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1739227604|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1739227604} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:22:42,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1063396386 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1063396386 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1063396386 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1063396386 256)))) (or (and (= ~z$r_buff1_thd1~0_In1063396386 |P0Thread1of1ForFork0_#t~ite8_Out1063396386|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1063396386|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1063396386, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1063396386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1063396386, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1063396386} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1063396386, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1063396386|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1063396386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1063396386, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1063396386} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:22:42,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:22:42,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:22:42,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-23180838 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-23180838 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-23180838| ~z~0_In-23180838) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-23180838| ~z$w_buff1~0_In-23180838) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-23180838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-23180838, ~z$w_buff1~0=~z$w_buff1~0_In-23180838, ~z~0=~z~0_In-23180838} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-23180838|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-23180838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-23180838, ~z$w_buff1~0=~z$w_buff1~0_In-23180838, ~z~0=~z~0_In-23180838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 01:22:42,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 01:22:42,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In773864289 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In773864289 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In773864289 |ULTIMATE.start_main_#t~ite42_Out773864289|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out773864289|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In773864289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In773864289} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In773864289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In773864289, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out773864289|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:22:42,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-2112984690 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2112984690 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-2112984690 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2112984690 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-2112984690| ~z$w_buff1_used~0_In-2112984690) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out-2112984690| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112984690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112984690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2112984690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2112984690} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112984690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112984690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2112984690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2112984690, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2112984690|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:22:42,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-66103324 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-66103324 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-66103324| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-66103324| ~z$r_buff0_thd0~0_In-66103324) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-66103324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-66103324} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-66103324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-66103324, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-66103324|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:22:42,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2010345967 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2010345967 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2010345967 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2010345967 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2010345967| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out2010345967| ~z$r_buff1_thd0~0_In2010345967) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010345967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010345967, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010345967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010345967} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010345967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010345967, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010345967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010345967, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2010345967|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:22:42,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p0_EBX~0_116 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:22:42,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:22:42 BasicIcfg [2019-12-27 01:22:42,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:22:42,431 INFO L168 Benchmark]: Toolchain (without parser) took 12645.63 ms. Allocated memory was 145.2 MB in the beginning and 377.0 MB in the end (delta: 231.7 MB). Free memory was 99.9 MB in the beginning and 89.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 242.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:22:42,432 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:22:42,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.19 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 156.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:22:42,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.12 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:22:42,434 INFO L168 Benchmark]: Boogie Preprocessor took 42.04 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:22:42,435 INFO L168 Benchmark]: RCFGBuilder took 796.49 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 106.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:22:42,436 INFO L168 Benchmark]: TraceAbstraction took 10941.48 ms. Allocated memory was 202.9 MB in the beginning and 377.0 MB in the end (delta: 174.1 MB). Free memory was 106.0 MB in the beginning and 89.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 190.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:22:42,440 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.46 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.19 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 156.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.12 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.04 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.49 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 106.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10941.48 ms. Allocated memory was 202.9 MB in the beginning and 377.0 MB in the end (delta: 174.1 MB). Free memory was 106.0 MB in the beginning and 89.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 190.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1444 SDtfs, 1077 SDslu, 2606 SDs, 0 SdLazy, 1183 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 3205 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 61740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...