/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:09:48,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:09:48,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:09:48,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:09:48,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:09:48,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:09:48,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:09:48,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:09:48,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:09:48,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:09:48,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:09:48,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:09:48,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:09:48,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:09:48,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:09:48,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:09:48,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:09:48,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:09:48,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:09:48,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:09:48,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:09:48,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:09:48,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:09:48,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:09:48,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:09:48,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:09:48,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:09:48,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:09:48,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:09:48,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:09:48,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:09:48,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:09:48,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:09:48,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:09:48,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:09:48,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:09:48,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:09:48,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:09:48,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:09:48,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:09:48,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:09:48,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:09:48,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:09:48,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:09:48,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:09:48,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:09:48,529 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:09:48,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:09:48,529 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:09:48,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:09:48,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:09:48,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:09:48,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:09:48,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:09:48,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:09:48,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:09:48,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:09:48,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:09:48,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:09:48,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:09:48,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:09:48,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:09:48,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:09:48,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:09:48,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:09:48,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:09:48,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:09:48,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:09:48,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:09:48,537 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:09:48,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:09:48,537 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:09:48,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:09:48,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:09:48,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:09:48,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:09:48,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:09:48,830 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:09:48,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-27 18:09:48,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c468962/5cab5f4d51c546448db44195d0cac738/FLAG1342b97f3 [2019-12-27 18:09:49,488 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:09:49,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-27 18:09:49,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c468962/5cab5f4d51c546448db44195d0cac738/FLAG1342b97f3 [2019-12-27 18:09:49,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c468962/5cab5f4d51c546448db44195d0cac738 [2019-12-27 18:09:49,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:09:49,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:09:49,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:09:49,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:09:49,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:09:49,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:09:49" (1/1) ... [2019-12-27 18:09:49,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:49, skipping insertion in model container [2019-12-27 18:09:49,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:09:49" (1/1) ... [2019-12-27 18:09:49,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:09:49,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:09:50,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:09:50,387 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:09:50,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:09:50,565 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:09:50,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50 WrapperNode [2019-12-27 18:09:50,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:09:50,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:09:50,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:09:50,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:09:50,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:09:50,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:09:50,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:09:50,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:09:50,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (1/1) ... [2019-12-27 18:09:50,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:09:50,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:09:50,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:09:50,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:09:50,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (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 18:09:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:09:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:09:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:09:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:09:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:09:50,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:09:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:09:50,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:09:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:09:50,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:09:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:09:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:09:50,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:09:50,751 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 18:09:51,512 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:09:51,512 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:09:51,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:09:51 BoogieIcfgContainer [2019-12-27 18:09:51,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:09:51,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:09:51,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:09:51,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:09:51,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:09:49" (1/3) ... [2019-12-27 18:09:51,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5620a46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:09:51, skipping insertion in model container [2019-12-27 18:09:51,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:09:50" (2/3) ... [2019-12-27 18:09:51,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5620a46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:09:51, skipping insertion in model container [2019-12-27 18:09:51,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:09:51" (3/3) ... [2019-12-27 18:09:51,522 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc.i [2019-12-27 18:09:51,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:09:51,532 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:09:51,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:09:51,540 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:09:51,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,578 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,578 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,578 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,579 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,580 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,615 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,615 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:09:51,653 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:09:51,673 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:09:51,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:09:51,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:09:51,674 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:09:51,674 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:09:51,674 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:09:51,674 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:09:51,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:09:51,691 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 18:09:51,693 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:09:51,796 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:09:51,797 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:09:51,812 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:09:51,835 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 18:09:51,887 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 18:09:51,887 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:09:51,894 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:09:51,914 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 18:09:51,916 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:09:56,762 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:09:56,875 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:09:56,904 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-27 18:09:56,905 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:09:56,908 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 18:10:15,413 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-27 18:10:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-27 18:10:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:10:15,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:15,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:10:15,422 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:15,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-27 18:10:15,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:15,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384943355] [2019-12-27 18:10:15,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:15,696 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 18:10:15,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384943355] [2019-12-27 18:10:15,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:15,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:10:15,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547394006] [2019-12-27 18:10:15,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:15,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:15,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:10:15,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:15,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:10:15,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:10:15,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:10:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:10:15,740 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-27 18:10:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:19,755 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-27 18:10:19,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:10:19,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:10:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:20,457 INFO L225 Difference]: With dead ends: 115182 [2019-12-27 18:10:20,458 INFO L226 Difference]: Without dead ends: 112830 [2019-12-27 18:10:20,459 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 18:10:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-27 18:10:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-27 18:10:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-27 18:10:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-27 18:10:27,569 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-27 18:10:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:27,569 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-27 18:10:27,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:10:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-27 18:10:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:10:27,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:27,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:10:27,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-27 18:10:27,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:27,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50493723] [2019-12-27 18:10:27,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:27,665 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 18:10:27,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50493723] [2019-12-27 18:10:27,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:27,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:10:27,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126810774] [2019-12-27 18:10:27,667 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:27,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:27,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:10:27,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:27,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:10:27,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:10:27,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:10:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:10:27,674 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-27 18:10:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:32,476 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-27 18:10:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:10:32,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:10:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:33,178 INFO L225 Difference]: With dead ends: 176302 [2019-12-27 18:10:33,178 INFO L226 Difference]: Without dead ends: 176253 [2019-12-27 18:10:33,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:10:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-27 18:10:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-27 18:10:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-27 18:10:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-27 18:10:47,141 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-27 18:10:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:10:47,141 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-27 18:10:47,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:10:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-27 18:10:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:10:47,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:10:47,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:10:47,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:10:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:10:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-27 18:10:47,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:10:47,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364266103] [2019-12-27 18:10:47,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:10:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:10:47,219 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 18:10:47,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364266103] [2019-12-27 18:10:47,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:10:47,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:10:47,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894374938] [2019-12-27 18:10:47,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:10:47,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:10:47,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:10:47,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:10:47,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:10:47,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:10:47,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:10:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:10:47,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:10:47,226 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-27 18:10:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:10:54,828 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-27 18:10:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:10:54,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:10:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:10:55,612 INFO L225 Difference]: With dead ends: 228428 [2019-12-27 18:10:55,612 INFO L226 Difference]: Without dead ends: 228365 [2019-12-27 18:10:55,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-27 18:11:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-27 18:11:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-27 18:11:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-27 18:11:06,447 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-27 18:11:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:06,449 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-27 18:11:06,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-27 18:11:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:11:06,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:06,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:06,453 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-27 18:11:06,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:06,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882355598] [2019-12-27 18:11:06,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:06,511 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 18:11:06,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882355598] [2019-12-27 18:11:06,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:06,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:06,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1900338319] [2019-12-27 18:11:06,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:06,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:06,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:11:06,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:06,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:06,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:06,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:06,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:06,516 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-27 18:11:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:06,653 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-27 18:11:06,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:06,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:11:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:06,717 INFO L225 Difference]: With dead ends: 38255 [2019-12-27 18:11:06,717 INFO L226 Difference]: Without dead ends: 38255 [2019-12-27 18:11:06,717 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 18:11:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-27 18:11:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-27 18:11:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-27 18:11:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-27 18:11:13,253 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-27 18:11:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:13,253 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-27 18:11:13,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-27 18:11:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:11:13,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:13,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:13,257 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:13,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-27 18:11:13,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:13,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008405091] [2019-12-27 18:11:13,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:13,350 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 18:11:13,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008405091] [2019-12-27 18:11:13,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:13,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:11:13,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [195977098] [2019-12-27 18:11:13,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:13,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:13,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 37 transitions. [2019-12-27 18:11:13,360 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:13,361 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:13,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:13,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:13,362 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-27 18:11:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:14,109 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-27 18:11:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:11:14,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:11:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:14,229 INFO L225 Difference]: With dead ends: 51712 [2019-12-27 18:11:14,230 INFO L226 Difference]: Without dead ends: 51699 [2019-12-27 18:11:14,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:11:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-27 18:11:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-27 18:11:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-27 18:11:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-27 18:11:15,017 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-27 18:11:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:15,017 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-27 18:11:15,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-27 18:11:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:11:15,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:15,032 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 18:11:15,032 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-27 18:11:15,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:15,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813169612] [2019-12-27 18:11:15,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:15,105 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 18:11:15,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813169612] [2019-12-27 18:11:15,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:15,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:11:15,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057558880] [2019-12-27 18:11:15,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:15,110 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:15,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:11:15,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:15,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:15,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:11:15,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:15,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:11:15,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:11:15,117 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-27 18:11:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:15,168 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-27 18:11:15,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:11:15,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:11:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:15,181 INFO L225 Difference]: With dead ends: 7422 [2019-12-27 18:11:15,181 INFO L226 Difference]: Without dead ends: 7422 [2019-12-27 18:11:15,181 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 18:11:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-27 18:11:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-27 18:11:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-27 18:11:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-27 18:11:15,284 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-27 18:11:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:15,284 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-27 18:11:15,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:11:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-27 18:11:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:11:15,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:15,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:15,296 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-27 18:11:15,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:15,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001490847] [2019-12-27 18:11:15,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:15,422 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 18:11:15,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001490847] [2019-12-27 18:11:15,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:15,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:11:15,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2107548103] [2019-12-27 18:11:15,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:15,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:15,458 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 92 transitions. [2019-12-27 18:11:15,458 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:15,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:11:15,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:15,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:15,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:15,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:15,462 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-27 18:11:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:15,510 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 18:11:15,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:11:15,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:11:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:15,518 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 18:11:15,518 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 18:11:15,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 18:11:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 18:11:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 18:11:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 18:11:15,592 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 18:11:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:15,592 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 18:11:15,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 18:11:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:11:15,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:15,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:15,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-27 18:11:15,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:15,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906119370] [2019-12-27 18:11:15,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:15,937 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 18:11:15,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906119370] [2019-12-27 18:11:15,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:15,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:11:15,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017758794] [2019-12-27 18:11:15,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:15,963 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:16,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 18:11:16,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:16,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:11:16,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:11:16,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:11:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:11:16,330 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 10 states. [2019-12-27 18:11:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:17,036 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-27 18:11:17,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:11:17,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 18:11:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:17,047 INFO L225 Difference]: With dead ends: 7539 [2019-12-27 18:11:17,047 INFO L226 Difference]: Without dead ends: 7539 [2019-12-27 18:11:17,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:11:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-27 18:11:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-27 18:11:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-27 18:11:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-27 18:11:17,143 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-27 18:11:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:17,144 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-27 18:11:17,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:11:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-27 18:11:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:11:17,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:11:17,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:17,154 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-27 18:11:17,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:17,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784883692] [2019-12-27 18:11:17,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:17,276 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 18:11:17,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784883692] [2019-12-27 18:11:17,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:17,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:17,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1476151650] [2019-12-27 18:11:17,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:17,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:17,411 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 357 transitions. [2019-12-27 18:11:17,411 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:17,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:11:17,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:17,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:17,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:17,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:17,419 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-27 18:11:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:17,454 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-27 18:11:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:17,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:11:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:17,461 INFO L225 Difference]: With dead ends: 5975 [2019-12-27 18:11:17,462 INFO L226 Difference]: Without dead ends: 5975 [2019-12-27 18:11:17,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:11:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-27 18:11:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-27 18:11:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-27 18:11:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-27 18:11:17,540 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-27 18:11:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:17,540 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-27 18:11:17,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-27 18:11:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:11:17,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:17,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:17,548 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-27 18:11:17,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:17,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34839016] [2019-12-27 18:11:17,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:17,658 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 18:11:17,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34839016] [2019-12-27 18:11:17,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:17,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:11:17,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1795890860] [2019-12-27 18:11:17,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:17,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:17,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 329 transitions. [2019-12-27 18:11:17,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:17,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:11:17,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:17,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:17,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:17,949 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-27 18:11:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:18,291 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-27 18:11:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:11:18,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:11:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:18,303 INFO L225 Difference]: With dead ends: 8394 [2019-12-27 18:11:18,303 INFO L226 Difference]: Without dead ends: 8394 [2019-12-27 18:11:18,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:11:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-27 18:11:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-27 18:11:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-27 18:11:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-27 18:11:18,409 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-27 18:11:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:18,409 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-27 18:11:18,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-27 18:11:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:11:18,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:18,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:18,422 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-27 18:11:18,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:18,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550821137] [2019-12-27 18:11:18,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:18,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550821137] [2019-12-27 18:11:18,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:18,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:18,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549118361] [2019-12-27 18:11:18,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:18,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:18,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 363 transitions. [2019-12-27 18:11:18,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:18,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:11:18,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:11:18,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:11:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:11:18,691 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 5 states. [2019-12-27 18:11:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:18,891 INFO L93 Difference]: Finished difference Result 7387 states and 20435 transitions. [2019-12-27 18:11:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:11:18,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:11:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:18,899 INFO L225 Difference]: With dead ends: 7387 [2019-12-27 18:11:18,899 INFO L226 Difference]: Without dead ends: 7387 [2019-12-27 18:11:18,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:11:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7387 states. [2019-12-27 18:11:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7387 to 5170. [2019-12-27 18:11:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-27 18:11:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 14519 transitions. [2019-12-27 18:11:18,979 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 14519 transitions. Word has length 66 [2019-12-27 18:11:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:18,979 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 14519 transitions. [2019-12-27 18:11:18,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:11:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 14519 transitions. [2019-12-27 18:11:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:11:18,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:18,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:18,986 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash 991626200, now seen corresponding path program 1 times [2019-12-27 18:11:18,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:18,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107293860] [2019-12-27 18:11:18,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:19,110 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 18:11:19,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107293860] [2019-12-27 18:11:19,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:19,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:11:19,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593533755] [2019-12-27 18:11:19,111 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:19,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:19,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 463 transitions. [2019-12-27 18:11:19,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:19,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:11:19,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:11:19,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:11:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:11:19,501 INFO L87 Difference]: Start difference. First operand 5170 states and 14519 transitions. Second operand 12 states. [2019-12-27 18:11:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:21,055 INFO L93 Difference]: Finished difference Result 7557 states and 21020 transitions. [2019-12-27 18:11:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:11:21,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 18:11:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:21,065 INFO L225 Difference]: With dead ends: 7557 [2019-12-27 18:11:21,065 INFO L226 Difference]: Without dead ends: 7557 [2019-12-27 18:11:21,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:11:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2019-12-27 18:11:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 5613. [2019-12-27 18:11:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-12-27 18:11:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 15757 transitions. [2019-12-27 18:11:21,146 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 15757 transitions. Word has length 67 [2019-12-27 18:11:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:21,146 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 15757 transitions. [2019-12-27 18:11:21,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:11:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 15757 transitions. [2019-12-27 18:11:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:11:21,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:21,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:21,154 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1617265986, now seen corresponding path program 2 times [2019-12-27 18:11:21,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:21,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756057890] [2019-12-27 18:11:21,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:21,274 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 18:11:21,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756057890] [2019-12-27 18:11:21,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:21,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:11:21,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131235386] [2019-12-27 18:11:21,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:21,294 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:21,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 402 transitions. [2019-12-27 18:11:21,513 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:21,590 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:11:21,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:11:21,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:21,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:11:21,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:11:21,592 INFO L87 Difference]: Start difference. First operand 5613 states and 15757 transitions. Second operand 9 states. [2019-12-27 18:11:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:22,247 INFO L93 Difference]: Finished difference Result 13821 states and 38600 transitions. [2019-12-27 18:11:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:11:22,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 18:11:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:22,259 INFO L225 Difference]: With dead ends: 13821 [2019-12-27 18:11:22,259 INFO L226 Difference]: Without dead ends: 9323 [2019-12-27 18:11:22,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:11:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9323 states. [2019-12-27 18:11:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9323 to 5279. [2019-12-27 18:11:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5279 states. [2019-12-27 18:11:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 14775 transitions. [2019-12-27 18:11:22,355 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 14775 transitions. Word has length 67 [2019-12-27 18:11:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:22,355 INFO L462 AbstractCegarLoop]: Abstraction has 5279 states and 14775 transitions. [2019-12-27 18:11:22,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:11:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 14775 transitions. [2019-12-27 18:11:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:11:22,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:22,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:22,362 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1057080962, now seen corresponding path program 3 times [2019-12-27 18:11:22,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:22,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342690861] [2019-12-27 18:11:22,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:22,444 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 18:11:22,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342690861] [2019-12-27 18:11:22,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:22,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:11:22,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1325559507] [2019-12-27 18:11:22,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:22,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:22,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 432 transitions. [2019-12-27 18:11:22,695 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:22,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:11:22,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:11:22,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:11:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:11:22,698 INFO L87 Difference]: Start difference. First operand 5279 states and 14775 transitions. Second operand 3 states. [2019-12-27 18:11:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:22,781 INFO L93 Difference]: Finished difference Result 5278 states and 14773 transitions. [2019-12-27 18:11:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:11:22,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:11:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:22,792 INFO L225 Difference]: With dead ends: 5278 [2019-12-27 18:11:22,792 INFO L226 Difference]: Without dead ends: 5278 [2019-12-27 18:11:22,796 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 18:11:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2019-12-27 18:11:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 2810. [2019-12-27 18:11:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-27 18:11:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-27 18:11:22,910 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 67 [2019-12-27 18:11:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:22,910 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-27 18:11:22,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:11:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-27 18:11:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:22,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:22,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:22,916 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 1 times [2019-12-27 18:11:22,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:22,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382806527] [2019-12-27 18:11:22,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:23,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382806527] [2019-12-27 18:11:23,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:23,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:11:23,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333704006] [2019-12-27 18:11:23,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:23,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:23,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 538 transitions. [2019-12-27 18:11:23,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:23,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:24,055 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 18:11:24,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:11:24,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:24,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:11:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:11:24,057 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 19 states. [2019-12-27 18:11:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:25,137 INFO L93 Difference]: Finished difference Result 5560 states and 15685 transitions. [2019-12-27 18:11:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:11:25,138 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 18:11:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:25,146 INFO L225 Difference]: With dead ends: 5560 [2019-12-27 18:11:25,146 INFO L226 Difference]: Without dead ends: 5535 [2019-12-27 18:11:25,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:11:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-12-27 18:11:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 3941. [2019-12-27 18:11:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-27 18:11:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-27 18:11:25,211 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-27 18:11:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:25,211 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-27 18:11:25,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:11:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-27 18:11:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:25,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:25,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:25,216 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 2 times [2019-12-27 18:11:25,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:25,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268112506] [2019-12-27 18:11:25,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:25,524 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 18:11:25,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268112506] [2019-12-27 18:11:25,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:25,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:11:25,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951666654] [2019-12-27 18:11:25,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:25,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:25,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 522 transitions. [2019-12-27 18:11:25,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:26,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:26,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 18:11:26,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:11:26,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:26,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:11:26,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:11:26,462 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 17 states. [2019-12-27 18:11:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:27,702 INFO L93 Difference]: Finished difference Result 6812 states and 19117 transitions. [2019-12-27 18:11:27,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 18:11:27,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 18:11:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:27,712 INFO L225 Difference]: With dead ends: 6812 [2019-12-27 18:11:27,712 INFO L226 Difference]: Without dead ends: 6787 [2019-12-27 18:11:27,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:11:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2019-12-27 18:11:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 4153. [2019-12-27 18:11:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2019-12-27 18:11:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 11647 transitions. [2019-12-27 18:11:27,781 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 11647 transitions. Word has length 68 [2019-12-27 18:11:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:27,782 INFO L462 AbstractCegarLoop]: Abstraction has 4153 states and 11647 transitions. [2019-12-27 18:11:27,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:11:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 11647 transitions. [2019-12-27 18:11:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:27,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:27,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:27,789 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 3 times [2019-12-27 18:11:27,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:27,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192037632] [2019-12-27 18:11:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:11:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:11:28,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192037632] [2019-12-27 18:11:28,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:11:28,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:11:28,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391399785] [2019-12-27 18:11:28,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:11:28,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:11:28,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 18:11:28,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:11:28,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:28,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:11:28,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 18:11:28,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:11:28,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:11:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:11:28,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:11:28,981 INFO L87 Difference]: Start difference. First operand 4153 states and 11647 transitions. Second operand 22 states. [2019-12-27 18:11:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:11:30,661 INFO L93 Difference]: Finished difference Result 6149 states and 17063 transitions. [2019-12-27 18:11:30,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 18:11:30,662 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-27 18:11:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:11:30,668 INFO L225 Difference]: With dead ends: 6149 [2019-12-27 18:11:30,669 INFO L226 Difference]: Without dead ends: 6124 [2019-12-27 18:11:30,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 21 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 18:11:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6124 states. [2019-12-27 18:11:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6124 to 4062. [2019-12-27 18:11:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-27 18:11:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-27 18:11:30,730 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-27 18:11:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:11:30,730 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-27 18:11:30,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:11:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-27 18:11:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:11:30,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:11:30,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:11:30,735 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:11:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:11:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 4 times [2019-12-27 18:11:30,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:11:30,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541385154] [2019-12-27 18:11:30,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:11:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:11:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:11:30,847 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:11:30,847 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:11:30,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= |v_ULTIMATE.start_main_~#t1961~0.offset_17| 0) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1961~0.base_23|) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1961~0.base_23| 4)) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_23|)) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1961~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1961~0.base_23|) |v_ULTIMATE.start_main_~#t1961~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z$flush_delayed~0_41) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_23| 1)) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_~#t1961~0.offset=|v_ULTIMATE.start_main_~#t1961~0.offset_17|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_21|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_~#t1961~0.base=|v_ULTIMATE.start_main_~#t1961~0.base_23|, ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_16|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1961~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1963~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1962~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1961~0.base, ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:11:30,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1962~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11|) |v_ULTIMATE.start_main_~#t1962~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1962~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1962~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1962~0.offset_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1962~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:11:30,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 18:11:30,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1963~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12|) |v_ULTIMATE.start_main_~#t1963~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1963~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1963~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1963~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1963~0.base] because there is no mapped edge [2019-12-27 18:11:30,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In133521364 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In133521364 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out133521364| ~z$w_buff0_used~0_In133521364)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out133521364| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In133521364, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In133521364} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out133521364|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In133521364, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In133521364} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:11:30,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In1601398270 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1601398270 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1601398270 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1601398270 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1601398270|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1601398270 |P0Thread1of1ForFork0_#t~ite6_Out1601398270|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1601398270, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1601398270, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1601398270, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1601398270} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1601398270|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1601398270, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1601398270, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1601398270, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1601398270} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:11:30,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1254478483 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1254478483 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In1254478483 ~z$r_buff0_thd1~0_Out1254478483) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1254478483)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1254478483, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1254478483} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1254478483, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1254478483|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1254478483} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:11:30,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1600733580 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1600733580 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1600733580 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1600733580 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1600733580| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1600733580| ~z$r_buff1_thd1~0_In1600733580) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1600733580, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1600733580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1600733580, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1600733580} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1600733580, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1600733580|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1600733580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1600733580, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1600733580} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:11:30,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} 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 18:11:30,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In673822859 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In673822859 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In673822859 |P1Thread1of1ForFork1_#t~ite9_Out673822859|)) (and (= ~z~0_In673822859 |P1Thread1of1ForFork1_#t~ite9_Out673822859|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In673822859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In673822859, ~z$w_buff1~0=~z$w_buff1~0_In673822859, ~z~0=~z~0_In673822859} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out673822859|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In673822859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In673822859, ~z$w_buff1~0=~z$w_buff1~0_In673822859, ~z~0=~z~0_In673822859} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:11:30,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 18:11:30,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-892222464 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-892222464 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-892222464| ~z$w_buff0_used~0_In-892222464) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-892222464|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-892222464, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-892222464} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-892222464, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-892222464|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-892222464} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:11:30,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1387125044 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1387125044 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1387125044| ~z~0_In1387125044)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1387125044| ~z$w_buff1~0_In1387125044)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1387125044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1387125044, ~z$w_buff1~0=~z$w_buff1~0_In1387125044, ~z~0=~z~0_In1387125044} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1387125044|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1387125044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1387125044, ~z$w_buff1~0=~z$w_buff1~0_In1387125044, ~z~0=~z~0_In1387125044} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:11:30,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In100635233 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In100635233 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In100635233 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In100635233 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out100635233| ~z$w_buff1_used~0_In100635233)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out100635233| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In100635233, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In100635233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In100635233, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In100635233} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In100635233, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In100635233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In100635233, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out100635233|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In100635233} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:11:30,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1713613865 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1713613865 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1713613865| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1713613865 |P1Thread1of1ForFork1_#t~ite13_Out1713613865|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1713613865, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1713613865} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1713613865, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1713613865|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1713613865} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:11:30,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 18:11:30,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In749042294 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In749042294 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out749042294| ~z$w_buff0_used~0_In749042294) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out749042294| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In749042294, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In749042294} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In749042294, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In749042294, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out749042294|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:11:30,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1993791 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1993791 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1993791 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1993791 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out1993791| 0)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out1993791| ~z$w_buff1_used~0_In1993791) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1993791, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1993791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1993791, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1993791} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1993791, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1993791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1993791, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1993791, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1993791|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:11:30,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-293688388 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-293688388 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-293688388| ~z$r_buff0_thd3~0_In-293688388) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-293688388| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-293688388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-293688388} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-293688388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-293688388, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-293688388|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:11:30,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1585240600 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1585240600 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1585240600 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1585240600 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out1585240600| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1585240600 |P2Thread1of1ForFork2_#t~ite20_Out1585240600|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1585240600, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1585240600, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1585240600, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1585240600} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1585240600, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1585240600|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1585240600, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1585240600, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1585240600} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:11:30,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:11:30,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In567745133 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In567745133 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In567745133 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In567745133 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out567745133| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out567745133| ~z$r_buff1_thd2~0_In567745133) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In567745133, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In567745133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In567745133, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In567745133} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In567745133, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In567745133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In567745133, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out567745133|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In567745133} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:11:30,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:11:30,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:11:30,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1081723457 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1081723457 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1081723457 |ULTIMATE.start_main_#t~ite24_Out-1081723457|) (not .cse1)) (and (= ~z~0_In-1081723457 |ULTIMATE.start_main_#t~ite24_Out-1081723457|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1081723457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1081723457, ~z$w_buff1~0=~z$w_buff1~0_In-1081723457, ~z~0=~z~0_In-1081723457} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1081723457, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1081723457|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1081723457, ~z$w_buff1~0=~z$w_buff1~0_In-1081723457, ~z~0=~z~0_In-1081723457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 18:11:30,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 18:11:30,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1941278360 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1941278360 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1941278360| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-1941278360| ~z$w_buff0_used~0_In-1941278360)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1941278360, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1941278360} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1941278360, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1941278360, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1941278360|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:11:30,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1882438326 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1882438326 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1882438326 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1882438326 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-1882438326| ~z$w_buff1_used~0_In-1882438326)) (and (= |ULTIMATE.start_main_#t~ite27_Out-1882438326| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1882438326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1882438326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1882438326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1882438326} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1882438326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1882438326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1882438326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1882438326, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1882438326|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:11:30,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In634355198 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In634355198 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out634355198| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In634355198 |ULTIMATE.start_main_#t~ite28_Out634355198|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In634355198, ~z$w_buff0_used~0=~z$w_buff0_used~0_In634355198} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In634355198, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out634355198|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In634355198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:11:30,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-816192111 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-816192111 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-816192111 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-816192111 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-816192111 |ULTIMATE.start_main_#t~ite29_Out-816192111|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-816192111|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-816192111, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-816192111, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-816192111, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-816192111} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-816192111, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-816192111|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-816192111, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-816192111, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-816192111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:11:30,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:11:30,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:11:30,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:11:30,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:11:30 BasicIcfg [2019-12-27 18:11:30,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:11:30,982 INFO L168 Benchmark]: Toolchain (without parser) took 101196.09 ms. Allocated memory was 145.8 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 18:11:30,983 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:11:30,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.77 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:30,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.59 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:30,989 INFO L168 Benchmark]: Boogie Preprocessor took 49.92 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:30,989 INFO L168 Benchmark]: RCFGBuilder took 830.18 ms. Allocated memory is still 203.4 MB. Free memory was 150.7 MB in the beginning and 100.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:11:30,990 INFO L168 Benchmark]: TraceAbstraction took 99465.46 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 18:11:31,001 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.19 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.77 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.59 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.92 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.18 ms. Allocated memory is still 203.4 MB. Free memory was 150.7 MB in the beginning and 100.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99465.46 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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_p1_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L811] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 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 [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 99.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2570 SDtfs, 3305 SDslu, 8659 SDs, 0 SdLazy, 5718 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 77 SyntacticMatches, 69 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 86788 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 771 ConstructedInterpolants, 0 QuantifiedInterpolants, 209902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...