/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:57:58,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:57:58,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:57:58,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:57:58,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:57:58,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:57:58,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:57:58,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:57:58,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:57:58,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:57:58,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:57:58,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:57:58,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:57:58,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:57:58,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:57:58,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:57:58,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:57:58,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:57:58,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:57:58,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:57:58,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:57:58,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:57:58,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:57:58,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:57:58,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:57:58,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:57:58,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:57:58,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:57:58,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:57:58,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:57:58,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:57:58,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:57:58,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:57:58,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:57:58,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:57:58,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:57:58,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:57:58,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:57:58,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:57:58,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:57:58,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:57:58,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:57:58,575 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:57:58,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:57:58,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:57:58,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:57:58,580 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:57:58,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:57:58,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:57:58,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:57:58,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:57:58,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:57:58,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:57:58,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:57:58,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:57:58,583 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:57:58,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:57:58,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:57:58,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:57:58,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:57:58,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:57:58,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:57:58,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:57:58,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:57:58,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:57:58,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:57:58,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:57:58,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:57:58,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:57:58,586 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:57:58,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:57:58,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:57:58,586 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:57:58,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:57:58,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:57:58,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:57:58,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:57:58,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:57:58,877 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:57:58,878 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i [2019-12-27 22:57:58,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cca6df7/551a7f6bc5fc47f0bfd9ed48e6568cbc/FLAGe4682efc2 [2019-12-27 22:57:59,448 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:57:59,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i [2019-12-27 22:57:59,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cca6df7/551a7f6bc5fc47f0bfd9ed48e6568cbc/FLAGe4682efc2 [2019-12-27 22:57:59,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cca6df7/551a7f6bc5fc47f0bfd9ed48e6568cbc [2019-12-27 22:57:59,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:57:59,768 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:57:59,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:57:59,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:57:59,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:57:59,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:57:59" (1/1) ... [2019-12-27 22:57:59,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:57:59, skipping insertion in model container [2019-12-27 22:57:59,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:57:59" (1/1) ... [2019-12-27 22:57:59,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:57:59,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:58:00,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:58:00,340 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:58:00,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:58:00,513 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:58:00,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00 WrapperNode [2019-12-27 22:58:00,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:58:00,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:58:00,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:58:00,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:58:00,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:58:00,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:58:00,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:58:00,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:58:00,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (1/1) ... [2019-12-27 22:58:00,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:58:00,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:58:00,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:58:00,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:58:00,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (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 22:58:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:58:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:58:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:58:00,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:58:00,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:58:00,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:58:00,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:58:00,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:58:00,691 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:58:00,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:58:00,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:58:00,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:58:00,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:58:00,693 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 22:58:01,416 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:58:01,417 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:58:01,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:58:01 BoogieIcfgContainer [2019-12-27 22:58:01,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:58:01,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:58:01,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:58:01,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:58:01,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:57:59" (1/3) ... [2019-12-27 22:58:01,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbabe6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:58:01, skipping insertion in model container [2019-12-27 22:58:01,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:58:00" (2/3) ... [2019-12-27 22:58:01,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbabe6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:58:01, skipping insertion in model container [2019-12-27 22:58:01,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:58:01" (3/3) ... [2019-12-27 22:58:01,428 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.oepc.i [2019-12-27 22:58:01,439 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:58:01,439 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:58:01,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:58:01,449 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:58:01,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,548 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,548 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:58:01,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:58:01,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:58:01,606 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:58:01,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:58:01,606 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:58:01,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:58:01,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:58:01,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:58:01,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:58:01,624 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 22:58:01,626 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 22:58:01,728 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 22:58:01,728 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:58:01,744 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:58:01,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 22:58:01,821 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 22:58:01,821 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:58:01,830 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:58:01,851 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:58:01,853 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:58:05,139 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 22:58:05,243 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 22:58:05,499 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 22:58:05,634 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 22:58:05,652 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75290 [2019-12-27 22:58:05,653 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 22:58:05,656 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-27 22:58:19,923 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92134 states. [2019-12-27 22:58:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 92134 states. [2019-12-27 22:58:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:58:19,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:19,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:58:19,932 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash 790879197, now seen corresponding path program 1 times [2019-12-27 22:58:19,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:19,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346630384] [2019-12-27 22:58:19,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:20,228 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 22:58:20,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346630384] [2019-12-27 22:58:20,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:20,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:58:20,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902406751] [2019-12-27 22:58:20,232 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:20,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:20,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:58:20,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:20,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:58:20,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:58:20,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:20,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:58:20,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:58:20,265 INFO L87 Difference]: Start difference. First operand 92134 states. Second operand 3 states. [2019-12-27 22:58:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:21,521 INFO L93 Difference]: Finished difference Result 90524 states and 389631 transitions. [2019-12-27 22:58:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:58:21,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:58:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:24,420 INFO L225 Difference]: With dead ends: 90524 [2019-12-27 22:58:24,421 INFO L226 Difference]: Without dead ends: 84882 [2019-12-27 22:58:24,424 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 22:58:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84882 states. [2019-12-27 22:58:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84882 to 84882. [2019-12-27 22:58:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84882 states. [2019-12-27 22:58:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84882 states to 84882 states and 364809 transitions. [2019-12-27 22:58:30,426 INFO L78 Accepts]: Start accepts. Automaton has 84882 states and 364809 transitions. Word has length 5 [2019-12-27 22:58:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:30,427 INFO L462 AbstractCegarLoop]: Abstraction has 84882 states and 364809 transitions. [2019-12-27 22:58:30,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:58:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 84882 states and 364809 transitions. [2019-12-27 22:58:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:58:30,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:30,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:58:30,437 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2214746, now seen corresponding path program 1 times [2019-12-27 22:58:30,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:30,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357758010] [2019-12-27 22:58:30,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:30,567 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 22:58:30,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357758010] [2019-12-27 22:58:30,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:30,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:58:30,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7291256] [2019-12-27 22:58:30,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:30,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:30,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:58:30,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:30,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:58:30,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:58:30,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:30,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:58:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:58:30,577 INFO L87 Difference]: Start difference. First operand 84882 states and 364809 transitions. Second operand 4 states. [2019-12-27 22:58:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:34,994 INFO L93 Difference]: Finished difference Result 130108 states and 534106 transitions. [2019-12-27 22:58:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:58:34,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:58:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:35,604 INFO L225 Difference]: With dead ends: 130108 [2019-12-27 22:58:35,604 INFO L226 Difference]: Without dead ends: 129996 [2019-12-27 22:58:35,605 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 22:58:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129996 states. [2019-12-27 22:58:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129996 to 120798. [2019-12-27 22:58:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120798 states. [2019-12-27 22:58:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120798 states to 120798 states and 501253 transitions. [2019-12-27 22:58:42,848 INFO L78 Accepts]: Start accepts. Automaton has 120798 states and 501253 transitions. Word has length 13 [2019-12-27 22:58:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:42,849 INFO L462 AbstractCegarLoop]: Abstraction has 120798 states and 501253 transitions. [2019-12-27 22:58:42,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:58:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 120798 states and 501253 transitions. [2019-12-27 22:58:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:58:42,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:42,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:58:42,854 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1319615161, now seen corresponding path program 1 times [2019-12-27 22:58:42,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:42,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903042283] [2019-12-27 22:58:42,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:42,930 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 22:58:42,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903042283] [2019-12-27 22:58:42,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:42,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:58:42,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1059160315] [2019-12-27 22:58:42,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:42,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:42,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:58:42,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:42,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:58:42,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:58:42,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:42,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:58:42,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:58:42,935 INFO L87 Difference]: Start difference. First operand 120798 states and 501253 transitions. Second operand 3 states. [2019-12-27 22:58:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:43,058 INFO L93 Difference]: Finished difference Result 29480 states and 98975 transitions. [2019-12-27 22:58:46,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:58:46,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:58:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:47,003 INFO L225 Difference]: With dead ends: 29480 [2019-12-27 22:58:47,003 INFO L226 Difference]: Without dead ends: 29480 [2019-12-27 22:58:47,003 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 22:58:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29480 states. [2019-12-27 22:58:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29480 to 29480. [2019-12-27 22:58:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29480 states. [2019-12-27 22:58:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29480 states to 29480 states and 98975 transitions. [2019-12-27 22:58:47,581 INFO L78 Accepts]: Start accepts. Automaton has 29480 states and 98975 transitions. Word has length 13 [2019-12-27 22:58:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:47,581 INFO L462 AbstractCegarLoop]: Abstraction has 29480 states and 98975 transitions. [2019-12-27 22:58:47,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:58:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 29480 states and 98975 transitions. [2019-12-27 22:58:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:58:47,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:47,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:58:47,585 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -856921002, now seen corresponding path program 1 times [2019-12-27 22:58:47,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:47,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399160881] [2019-12-27 22:58:47,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:47,671 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 22:58:47,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399160881] [2019-12-27 22:58:47,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:47,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:58:47,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1622733935] [2019-12-27 22:58:47,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:47,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:47,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:58:47,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:47,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:58:47,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:58:47,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:47,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:58:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:58:47,755 INFO L87 Difference]: Start difference. First operand 29480 states and 98975 transitions. Second operand 7 states. [2019-12-27 22:58:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:48,420 INFO L93 Difference]: Finished difference Result 42246 states and 139417 transitions. [2019-12-27 22:58:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:58:48,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 22:58:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:48,491 INFO L225 Difference]: With dead ends: 42246 [2019-12-27 22:58:48,491 INFO L226 Difference]: Without dead ends: 42228 [2019-12-27 22:58:48,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:58:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42228 states. [2019-12-27 22:58:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42228 to 33417. [2019-12-27 22:58:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2019-12-27 22:58:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 111616 transitions. [2019-12-27 22:58:49,450 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 111616 transitions. Word has length 14 [2019-12-27 22:58:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:49,451 INFO L462 AbstractCegarLoop]: Abstraction has 33417 states and 111616 transitions. [2019-12-27 22:58:49,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:58:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 111616 transitions. [2019-12-27 22:58:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:58:49,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:49,461 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] [2019-12-27 22:58:49,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1451441927, now seen corresponding path program 1 times [2019-12-27 22:58:49,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:49,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609291183] [2019-12-27 22:58:49,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:49,595 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 22:58:49,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609291183] [2019-12-27 22:58:49,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:49,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:58:49,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596525996] [2019-12-27 22:58:49,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:49,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:49,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 98 transitions. [2019-12-27 22:58:49,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:49,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:58:49,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:58:49,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:49,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:58:49,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:58:49,676 INFO L87 Difference]: Start difference. First operand 33417 states and 111616 transitions. Second operand 8 states. [2019-12-27 22:58:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:51,282 INFO L93 Difference]: Finished difference Result 103548 states and 339165 transitions. [2019-12-27 22:58:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:58:51,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 22:58:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:51,495 INFO L225 Difference]: With dead ends: 103548 [2019-12-27 22:58:51,495 INFO L226 Difference]: Without dead ends: 103495 [2019-12-27 22:58:51,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:58:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103495 states. [2019-12-27 22:58:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103495 to 48451. [2019-12-27 22:58:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48451 states. [2019-12-27 22:58:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48451 states to 48451 states and 161139 transitions. [2019-12-27 22:58:53,106 INFO L78 Accepts]: Start accepts. Automaton has 48451 states and 161139 transitions. Word has length 22 [2019-12-27 22:58:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:53,107 INFO L462 AbstractCegarLoop]: Abstraction has 48451 states and 161139 transitions. [2019-12-27 22:58:53,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:58:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 48451 states and 161139 transitions. [2019-12-27 22:58:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:58:53,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:53,122 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] [2019-12-27 22:58:53,122 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1423197899, now seen corresponding path program 2 times [2019-12-27 22:58:53,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:53,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056935917] [2019-12-27 22:58:53,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:53,212 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 22:58:53,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056935917] [2019-12-27 22:58:53,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:53,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:58:53,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978937480] [2019-12-27 22:58:53,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:53,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:53,223 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 22:58:53,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:53,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:58:53,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:58:53,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:58:53,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:58:53,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:53,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:58:53,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:58:53,278 INFO L87 Difference]: Start difference. First operand 48451 states and 161139 transitions. Second operand 8 states. [2019-12-27 22:58:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:54,487 INFO L93 Difference]: Finished difference Result 73223 states and 237857 transitions. [2019-12-27 22:58:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:58:54,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 22:58:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:54,614 INFO L225 Difference]: With dead ends: 73223 [2019-12-27 22:58:54,614 INFO L226 Difference]: Without dead ends: 73201 [2019-12-27 22:58:54,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:58:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73201 states. [2019-12-27 22:58:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73201 to 43461. [2019-12-27 22:58:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43461 states. [2019-12-27 22:58:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43461 states to 43461 states and 145200 transitions. [2019-12-27 22:58:55,949 INFO L78 Accepts]: Start accepts. Automaton has 43461 states and 145200 transitions. Word has length 22 [2019-12-27 22:58:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:55,949 INFO L462 AbstractCegarLoop]: Abstraction has 43461 states and 145200 transitions. [2019-12-27 22:58:55,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:58:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 43461 states and 145200 transitions. [2019-12-27 22:58:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:58:55,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:55,964 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 22:58:55,964 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1210888405, now seen corresponding path program 1 times [2019-12-27 22:58:55,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:55,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845990268] [2019-12-27 22:58:55,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:56,020 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 22:58:56,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845990268] [2019-12-27 22:58:56,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:56,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:58:56,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238510493] [2019-12-27 22:58:56,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:56,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:56,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:58:56,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:56,029 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:58:56,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:58:56,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:58:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:58:56,030 INFO L87 Difference]: Start difference. First operand 43461 states and 145200 transitions. Second operand 4 states. [2019-12-27 22:58:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:56,112 INFO L93 Difference]: Finished difference Result 17565 states and 54809 transitions. [2019-12-27 22:58:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:58:56,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:58:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:56,136 INFO L225 Difference]: With dead ends: 17565 [2019-12-27 22:58:56,136 INFO L226 Difference]: Without dead ends: 17565 [2019-12-27 22:58:56,137 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 22:58:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-27 22:58:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 17131. [2019-12-27 22:58:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17131 states. [2019-12-27 22:58:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17131 states to 17131 states and 53496 transitions. [2019-12-27 22:58:56,387 INFO L78 Accepts]: Start accepts. Automaton has 17131 states and 53496 transitions. Word has length 25 [2019-12-27 22:58:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:56,387 INFO L462 AbstractCegarLoop]: Abstraction has 17131 states and 53496 transitions. [2019-12-27 22:58:56,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:58:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 17131 states and 53496 transitions. [2019-12-27 22:58:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:58:56,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:56,411 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] [2019-12-27 22:58:56,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1136830823, now seen corresponding path program 1 times [2019-12-27 22:58:56,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:56,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053989381] [2019-12-27 22:58:56,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:56,473 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 22:58:56,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053989381] [2019-12-27 22:58:56,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:56,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:58:56,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [214677608] [2019-12-27 22:58:56,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:56,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:56,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 100 transitions. [2019-12-27 22:58:56,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:56,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:58:56,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:58:56,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:56,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:58:56,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:58:56,506 INFO L87 Difference]: Start difference. First operand 17131 states and 53496 transitions. Second operand 3 states. [2019-12-27 22:58:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:56,598 INFO L93 Difference]: Finished difference Result 31165 states and 97071 transitions. [2019-12-27 22:58:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:58:56,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 22:58:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:56,623 INFO L225 Difference]: With dead ends: 31165 [2019-12-27 22:58:56,623 INFO L226 Difference]: Without dead ends: 17192 [2019-12-27 22:58:56,623 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 22:58:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17192 states. [2019-12-27 22:58:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17192 to 16933. [2019-12-27 22:58:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16933 states. [2019-12-27 22:58:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16933 states to 16933 states and 51736 transitions. [2019-12-27 22:58:56,866 INFO L78 Accepts]: Start accepts. Automaton has 16933 states and 51736 transitions. Word has length 39 [2019-12-27 22:58:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:56,866 INFO L462 AbstractCegarLoop]: Abstraction has 16933 states and 51736 transitions. [2019-12-27 22:58:56,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:58:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 16933 states and 51736 transitions. [2019-12-27 22:58:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:58:56,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:56,899 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] [2019-12-27 22:58:56,899 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash -285407363, now seen corresponding path program 1 times [2019-12-27 22:58:56,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:56,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914617891] [2019-12-27 22:58:56,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:56,963 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 22:58:56,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914617891] [2019-12-27 22:58:56,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:56,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:58:56,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [104562996] [2019-12-27 22:58:56,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:56,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:57,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 176 transitions. [2019-12-27 22:58:57,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:57,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:58:57,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:58:57,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:58:57,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:58:57,036 INFO L87 Difference]: Start difference. First operand 16933 states and 51736 transitions. Second operand 6 states. [2019-12-27 22:58:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:57,206 INFO L93 Difference]: Finished difference Result 15478 states and 47982 transitions. [2019-12-27 22:58:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:58:57,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 22:58:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:57,234 INFO L225 Difference]: With dead ends: 15478 [2019-12-27 22:58:57,235 INFO L226 Difference]: Without dead ends: 13023 [2019-12-27 22:58:57,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:58:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2019-12-27 22:58:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 12057. [2019-12-27 22:58:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12057 states. [2019-12-27 22:58:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12057 states to 12057 states and 38293 transitions. [2019-12-27 22:58:57,514 INFO L78 Accepts]: Start accepts. Automaton has 12057 states and 38293 transitions. Word has length 40 [2019-12-27 22:58:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:57,515 INFO L462 AbstractCegarLoop]: Abstraction has 12057 states and 38293 transitions. [2019-12-27 22:58:57,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:58:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12057 states and 38293 transitions. [2019-12-27 22:58:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:58:57,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:57,533 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] [2019-12-27 22:58:57,533 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash 72230609, now seen corresponding path program 1 times [2019-12-27 22:58:57,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:57,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100692498] [2019-12-27 22:58:57,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:57,593 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 22:58:57,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100692498] [2019-12-27 22:58:57,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:57,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:58:57,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [118113174] [2019-12-27 22:58:57,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:57,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:57,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 380 transitions. [2019-12-27 22:58:57,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:57,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:58:57,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:58:57,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:58:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:58:57,891 INFO L87 Difference]: Start difference. First operand 12057 states and 38293 transitions. Second operand 3 states. [2019-12-27 22:58:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:58:58,021 INFO L93 Difference]: Finished difference Result 14716 states and 45602 transitions. [2019-12-27 22:58:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:58:58,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:58:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:58:58,058 INFO L225 Difference]: With dead ends: 14716 [2019-12-27 22:58:58,058 INFO L226 Difference]: Without dead ends: 14716 [2019-12-27 22:58:58,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 22:58:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14716 states. [2019-12-27 22:58:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14716 to 10787. [2019-12-27 22:58:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10787 states. [2019-12-27 22:58:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10787 states to 10787 states and 33634 transitions. [2019-12-27 22:58:58,390 INFO L78 Accepts]: Start accepts. Automaton has 10787 states and 33634 transitions. Word has length 54 [2019-12-27 22:58:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:58:58,390 INFO L462 AbstractCegarLoop]: Abstraction has 10787 states and 33634 transitions. [2019-12-27 22:58:58,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:58:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states and 33634 transitions. [2019-12-27 22:58:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:58:58,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:58:58,409 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] [2019-12-27 22:58:58,409 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:58:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:58:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1591694771, now seen corresponding path program 1 times [2019-12-27 22:58:58,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:58:58,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140617148] [2019-12-27 22:58:58,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:58:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:58:58,542 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 22:58:58,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140617148] [2019-12-27 22:58:58,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:58:58,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:58:58,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2137895692] [2019-12-27 22:58:58,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:58:58,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:58:58,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 380 transitions. [2019-12-27 22:58:58,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:58:58,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:58:58,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:58:58,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:58:58,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:58:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:58:58,808 INFO L87 Difference]: Start difference. First operand 10787 states and 33634 transitions. Second operand 8 states. [2019-12-27 22:59:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:00,061 INFO L93 Difference]: Finished difference Result 71156 states and 218314 transitions. [2019-12-27 22:59:00,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 22:59:00,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:59:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:00,138 INFO L225 Difference]: With dead ends: 71156 [2019-12-27 22:59:00,139 INFO L226 Difference]: Without dead ends: 50595 [2019-12-27 22:59:00,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:59:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50595 states. [2019-12-27 22:59:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50595 to 17639. [2019-12-27 22:59:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17639 states. [2019-12-27 22:59:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17639 states to 17639 states and 55460 transitions. [2019-12-27 22:59:00,920 INFO L78 Accepts]: Start accepts. Automaton has 17639 states and 55460 transitions. Word has length 54 [2019-12-27 22:59:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:00,920 INFO L462 AbstractCegarLoop]: Abstraction has 17639 states and 55460 transitions. [2019-12-27 22:59:00,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:59:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 17639 states and 55460 transitions. [2019-12-27 22:59:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:00,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:00,940 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] [2019-12-27 22:59:00,940 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 944548917, now seen corresponding path program 2 times [2019-12-27 22:59:00,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:00,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850424898] [2019-12-27 22:59:00,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:01,034 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 22:59:01,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850424898] [2019-12-27 22:59:01,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:01,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:59:01,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1124718589] [2019-12-27 22:59:01,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:01,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:01,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 381 transitions. [2019-12-27 22:59:01,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:01,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:59:01,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:59:01,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:59:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:59:01,248 INFO L87 Difference]: Start difference. First operand 17639 states and 55460 transitions. Second operand 7 states. [2019-12-27 22:59:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:01,658 INFO L93 Difference]: Finished difference Result 46437 states and 142749 transitions. [2019-12-27 22:59:01,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:59:01,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:59:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:01,709 INFO L225 Difference]: With dead ends: 46437 [2019-12-27 22:59:01,709 INFO L226 Difference]: Without dead ends: 34594 [2019-12-27 22:59:01,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:59:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34594 states. [2019-12-27 22:59:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34594 to 20927. [2019-12-27 22:59:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20927 states. [2019-12-27 22:59:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20927 states to 20927 states and 65842 transitions. [2019-12-27 22:59:02,148 INFO L78 Accepts]: Start accepts. Automaton has 20927 states and 65842 transitions. Word has length 54 [2019-12-27 22:59:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:02,148 INFO L462 AbstractCegarLoop]: Abstraction has 20927 states and 65842 transitions. [2019-12-27 22:59:02,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:59:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 20927 states and 65842 transitions. [2019-12-27 22:59:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:02,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:02,184 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] [2019-12-27 22:59:02,184 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:02,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash -472146899, now seen corresponding path program 3 times [2019-12-27 22:59:02,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:02,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202469376] [2019-12-27 22:59:02,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:02,271 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 22:59:02,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202469376] [2019-12-27 22:59:02,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:02,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:59:02,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1068442065] [2019-12-27 22:59:02,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:02,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:02,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 326 transitions. [2019-12-27 22:59:02,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:02,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:59:02,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:59:02,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 22:59:02,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:59:02,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:02,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:59:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:59:02,903 INFO L87 Difference]: Start difference. First operand 20927 states and 65842 transitions. Second operand 13 states. [2019-12-27 22:59:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:06,815 INFO L93 Difference]: Finished difference Result 79390 states and 241496 transitions. [2019-12-27 22:59:06,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 22:59:06,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:59:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:06,916 INFO L225 Difference]: With dead ends: 79390 [2019-12-27 22:59:06,916 INFO L226 Difference]: Without dead ends: 62791 [2019-12-27 22:59:06,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 22:59:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62791 states. [2019-12-27 22:59:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62791 to 22835. [2019-12-27 22:59:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22835 states. [2019-12-27 22:59:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22835 states to 22835 states and 72199 transitions. [2019-12-27 22:59:07,608 INFO L78 Accepts]: Start accepts. Automaton has 22835 states and 72199 transitions. Word has length 54 [2019-12-27 22:59:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:07,609 INFO L462 AbstractCegarLoop]: Abstraction has 22835 states and 72199 transitions. [2019-12-27 22:59:07,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:59:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 22835 states and 72199 transitions. [2019-12-27 22:59:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:07,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:07,647 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] [2019-12-27 22:59:07,648 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1509447759, now seen corresponding path program 1 times [2019-12-27 22:59:07,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:07,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720493796] [2019-12-27 22:59:07,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:07,699 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 22:59:07,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720493796] [2019-12-27 22:59:07,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:07,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:59:07,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978432762] [2019-12-27 22:59:07,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:07,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:07,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 277 transitions. [2019-12-27 22:59:07,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:07,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:59:07,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:59:07,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:07,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:59:07,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:59:07,863 INFO L87 Difference]: Start difference. First operand 22835 states and 72199 transitions. Second operand 3 states. [2019-12-27 22:59:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:07,967 INFO L93 Difference]: Finished difference Result 24419 states and 75048 transitions. [2019-12-27 22:59:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:59:07,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:59:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:08,001 INFO L225 Difference]: With dead ends: 24419 [2019-12-27 22:59:08,002 INFO L226 Difference]: Without dead ends: 24419 [2019-12-27 22:59:08,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 22:59:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24419 states. [2019-12-27 22:59:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24419 to 18590. [2019-12-27 22:59:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18590 states. [2019-12-27 22:59:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18590 states to 18590 states and 57479 transitions. [2019-12-27 22:59:08,336 INFO L78 Accepts]: Start accepts. Automaton has 18590 states and 57479 transitions. Word has length 54 [2019-12-27 22:59:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:08,337 INFO L462 AbstractCegarLoop]: Abstraction has 18590 states and 57479 transitions. [2019-12-27 22:59:08,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:59:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18590 states and 57479 transitions. [2019-12-27 22:59:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:08,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:08,358 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] [2019-12-27 22:59:08,359 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:08,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:08,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1033313199, now seen corresponding path program 4 times [2019-12-27 22:59:08,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:08,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54213275] [2019-12-27 22:59:08,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:08,454 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 22:59:08,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54213275] [2019-12-27 22:59:08,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:08,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:59:08,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048481708] [2019-12-27 22:59:08,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:08,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:08,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 315 transitions. [2019-12-27 22:59:08,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:08,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:59:08,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:59:08,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:08,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:59:08,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:59:08,802 INFO L87 Difference]: Start difference. First operand 18590 states and 57479 transitions. Second operand 7 states. [2019-12-27 22:59:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:09,232 INFO L93 Difference]: Finished difference Result 37857 states and 113201 transitions. [2019-12-27 22:59:09,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:59:09,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:59:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:09,285 INFO L225 Difference]: With dead ends: 37857 [2019-12-27 22:59:09,285 INFO L226 Difference]: Without dead ends: 32225 [2019-12-27 22:59:09,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:59:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32225 states. [2019-12-27 22:59:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32225 to 18746. [2019-12-27 22:59:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18746 states. [2019-12-27 22:59:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18746 states to 18746 states and 57909 transitions. [2019-12-27 22:59:09,689 INFO L78 Accepts]: Start accepts. Automaton has 18746 states and 57909 transitions. Word has length 54 [2019-12-27 22:59:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:09,690 INFO L462 AbstractCegarLoop]: Abstraction has 18746 states and 57909 transitions. [2019-12-27 22:59:09,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:59:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18746 states and 57909 transitions. [2019-12-27 22:59:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:09,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:09,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:09,711 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1310665995, now seen corresponding path program 5 times [2019-12-27 22:59:09,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:09,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992945813] [2019-12-27 22:59:09,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:09,797 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 22:59:09,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992945813] [2019-12-27 22:59:09,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:09,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:59:09,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1393223793] [2019-12-27 22:59:09,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:09,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:10,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 427 transitions. [2019-12-27 22:59:10,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:10,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:59:10,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:59:10,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:10,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:59:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:59:10,079 INFO L87 Difference]: Start difference. First operand 18746 states and 57909 transitions. Second operand 6 states. [2019-12-27 22:59:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:10,872 INFO L93 Difference]: Finished difference Result 32318 states and 96195 transitions. [2019-12-27 22:59:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:59:10,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 22:59:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:10,919 INFO L225 Difference]: With dead ends: 32318 [2019-12-27 22:59:10,919 INFO L226 Difference]: Without dead ends: 32234 [2019-12-27 22:59:10,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:59:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32234 states. [2019-12-27 22:59:11,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32234 to 21546. [2019-12-27 22:59:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21546 states. [2019-12-27 22:59:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21546 states to 21546 states and 66096 transitions. [2019-12-27 22:59:11,356 INFO L78 Accepts]: Start accepts. Automaton has 21546 states and 66096 transitions. Word has length 54 [2019-12-27 22:59:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:11,356 INFO L462 AbstractCegarLoop]: Abstraction has 21546 states and 66096 transitions. [2019-12-27 22:59:11,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:59:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 21546 states and 66096 transitions. [2019-12-27 22:59:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:11,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:11,382 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] [2019-12-27 22:59:11,382 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash 454744557, now seen corresponding path program 6 times [2019-12-27 22:59:11,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:11,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674092110] [2019-12-27 22:59:11,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:11,474 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 22:59:11,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674092110] [2019-12-27 22:59:11,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:11,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:59:11,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590238589] [2019-12-27 22:59:11,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:11,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:11,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 263 transitions. [2019-12-27 22:59:11,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:11,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:59:11,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:59:11,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:59:11,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:59:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:59:11,937 INFO L87 Difference]: Start difference. First operand 21546 states and 66096 transitions. Second operand 12 states. [2019-12-27 22:59:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:16,213 INFO L93 Difference]: Finished difference Result 46576 states and 138567 transitions. [2019-12-27 22:59:16,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 22:59:16,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 22:59:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:16,280 INFO L225 Difference]: With dead ends: 46576 [2019-12-27 22:59:16,281 INFO L226 Difference]: Without dead ends: 46576 [2019-12-27 22:59:16,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=2089, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 22:59:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46576 states. [2019-12-27 22:59:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46576 to 27021. [2019-12-27 22:59:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27021 states. [2019-12-27 22:59:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27021 states to 27021 states and 83251 transitions. [2019-12-27 22:59:16,828 INFO L78 Accepts]: Start accepts. Automaton has 27021 states and 83251 transitions. Word has length 54 [2019-12-27 22:59:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:16,828 INFO L462 AbstractCegarLoop]: Abstraction has 27021 states and 83251 transitions. [2019-12-27 22:59:16,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:59:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 27021 states and 83251 transitions. [2019-12-27 22:59:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:16,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:16,858 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] [2019-12-27 22:59:16,858 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1507078609, now seen corresponding path program 7 times [2019-12-27 22:59:16,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:16,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932343419] [2019-12-27 22:59:16,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:16,992 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 22:59:16,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932343419] [2019-12-27 22:59:16,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:16,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:59:16,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340135970] [2019-12-27 22:59:16,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:17,007 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:17,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 275 states and 496 transitions. [2019-12-27 22:59:17,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:59:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:59:17,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:59:17,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:59:17,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:59:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:59:17,407 INFO L87 Difference]: Start difference. First operand 27021 states and 83251 transitions. Second operand 14 states. [2019-12-27 22:59:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:24,200 INFO L93 Difference]: Finished difference Result 72341 states and 212926 transitions. [2019-12-27 22:59:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 22:59:24,200 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 22:59:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:24,308 INFO L225 Difference]: With dead ends: 72341 [2019-12-27 22:59:24,308 INFO L226 Difference]: Without dead ends: 72215 [2019-12-27 22:59:24,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=660, Invalid=3896, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 22:59:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72215 states. [2019-12-27 22:59:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72215 to 31669. [2019-12-27 22:59:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31669 states. [2019-12-27 22:59:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31669 states to 31669 states and 96430 transitions. [2019-12-27 22:59:25,162 INFO L78 Accepts]: Start accepts. Automaton has 31669 states and 96430 transitions. Word has length 54 [2019-12-27 22:59:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:25,162 INFO L462 AbstractCegarLoop]: Abstraction has 31669 states and 96430 transitions. [2019-12-27 22:59:25,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:59:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 31669 states and 96430 transitions. [2019-12-27 22:59:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:25,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:25,196 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] [2019-12-27 22:59:25,196 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1799112527, now seen corresponding path program 8 times [2019-12-27 22:59:25,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:25,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922088143] [2019-12-27 22:59:25,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:25,367 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 22:59:25,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922088143] [2019-12-27 22:59:25,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:25,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:59:25,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [363784165] [2019-12-27 22:59:25,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:25,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:25,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 372 transitions. [2019-12-27 22:59:25,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:26,727 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-27 22:59:26,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 22:59:26,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 22:59:26,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:26,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 22:59:26,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:59:26,730 INFO L87 Difference]: Start difference. First operand 31669 states and 96430 transitions. Second operand 22 states. [2019-12-27 22:59:27,799 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-12-27 22:59:28,117 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-27 22:59:29,153 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-12-27 22:59:33,981 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 22:59:34,968 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 22:59:35,848 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 22:59:37,202 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-27 22:59:37,375 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-27 22:59:37,614 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 22:59:40,530 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 22:59:41,045 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 22:59:41,449 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 22:59:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:42,854 INFO L93 Difference]: Finished difference Result 91531 states and 267063 transitions. [2019-12-27 22:59:42,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 22:59:42,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2019-12-27 22:59:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:42,990 INFO L225 Difference]: With dead ends: 91531 [2019-12-27 22:59:42,991 INFO L226 Difference]: Without dead ends: 91193 [2019-12-27 22:59:42,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4253 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2218, Invalid=10438, Unknown=0, NotChecked=0, Total=12656 [2019-12-27 22:59:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91193 states. [2019-12-27 22:59:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91193 to 37244. [2019-12-27 22:59:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37244 states. [2019-12-27 22:59:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37244 states to 37244 states and 111565 transitions. [2019-12-27 22:59:44,119 INFO L78 Accepts]: Start accepts. Automaton has 37244 states and 111565 transitions. Word has length 54 [2019-12-27 22:59:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:44,119 INFO L462 AbstractCegarLoop]: Abstraction has 37244 states and 111565 transitions. [2019-12-27 22:59:44,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 22:59:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 37244 states and 111565 transitions. [2019-12-27 22:59:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:44,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:44,162 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] [2019-12-27 22:59:44,162 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash 83564179, now seen corresponding path program 9 times [2019-12-27 22:59:44,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:44,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327903075] [2019-12-27 22:59:44,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:44,279 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 22:59:44,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327903075] [2019-12-27 22:59:44,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:44,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:59:44,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1910120878] [2019-12-27 22:59:44,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:44,294 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:44,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 401 transitions. [2019-12-27 22:59:44,664 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:44,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:59:44,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:59:44,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:59:44,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:59:44,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:44,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:59:44,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:59:44,984 INFO L87 Difference]: Start difference. First operand 37244 states and 111565 transitions. Second operand 15 states. [2019-12-27 22:59:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:50,568 INFO L93 Difference]: Finished difference Result 121460 states and 359441 transitions. [2019-12-27 22:59:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 22:59:50,569 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 22:59:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:50,765 INFO L225 Difference]: With dead ends: 121460 [2019-12-27 22:59:50,765 INFO L226 Difference]: Without dead ends: 120882 [2019-12-27 22:59:50,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=590, Invalid=2166, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 22:59:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120882 states. [2019-12-27 22:59:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120882 to 37506. [2019-12-27 22:59:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37506 states. [2019-12-27 22:59:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37506 states to 37506 states and 112578 transitions. [2019-12-27 22:59:52,540 INFO L78 Accepts]: Start accepts. Automaton has 37506 states and 112578 transitions. Word has length 54 [2019-12-27 22:59:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:52,540 INFO L462 AbstractCegarLoop]: Abstraction has 37506 states and 112578 transitions. [2019-12-27 22:59:52,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:59:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 37506 states and 112578 transitions. [2019-12-27 22:59:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:59:52,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:52,584 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] [2019-12-27 22:59:52,584 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash 367149589, now seen corresponding path program 10 times [2019-12-27 22:59:52,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:52,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091764258] [2019-12-27 22:59:52,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:59:52,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091764258] [2019-12-27 22:59:52,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:52,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:59:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606749806] [2019-12-27 22:59:52,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:52,657 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:52,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 459 transitions. [2019-12-27 22:59:52,918 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:52,919 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:59:52,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:59:52,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:59:52,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:59:52,920 INFO L87 Difference]: Start difference. First operand 37506 states and 112578 transitions. Second operand 3 states. [2019-12-27 22:59:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:53,115 INFO L93 Difference]: Finished difference Result 37506 states and 112576 transitions. [2019-12-27 22:59:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:59:53,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:59:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:53,201 INFO L225 Difference]: With dead ends: 37506 [2019-12-27 22:59:53,201 INFO L226 Difference]: Without dead ends: 37506 [2019-12-27 22:59:53,201 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 22:59:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37506 states. [2019-12-27 22:59:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37506 to 32426. [2019-12-27 22:59:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32426 states. [2019-12-27 22:59:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32426 states to 32426 states and 99215 transitions. [2019-12-27 22:59:53,784 INFO L78 Accepts]: Start accepts. Automaton has 32426 states and 99215 transitions. Word has length 54 [2019-12-27 22:59:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:53,784 INFO L462 AbstractCegarLoop]: Abstraction has 32426 states and 99215 transitions. [2019-12-27 22:59:53,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:59:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 32426 states and 99215 transitions. [2019-12-27 22:59:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:59:53,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:53,821 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] [2019-12-27 22:59:53,821 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash -409945417, now seen corresponding path program 1 times [2019-12-27 22:59:53,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:53,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963029913] [2019-12-27 22:59:53,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:59:53,870 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 22:59:53,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963029913] [2019-12-27 22:59:53,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:59:53,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:59:53,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074109029] [2019-12-27 22:59:53,872 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:59:53,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:59:54,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 496 transitions. [2019-12-27 22:59:54,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:59:54,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:59:54,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:59:54,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:59:54,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:59:54,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:59:54,126 INFO L87 Difference]: Start difference. First operand 32426 states and 99215 transitions. Second operand 3 states. [2019-12-27 22:59:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:59:54,247 INFO L93 Difference]: Finished difference Result 25959 states and 78529 transitions. [2019-12-27 22:59:54,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:59:54,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:59:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:59:54,282 INFO L225 Difference]: With dead ends: 25959 [2019-12-27 22:59:54,282 INFO L226 Difference]: Without dead ends: 25959 [2019-12-27 22:59:54,283 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 22:59:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25959 states. [2019-12-27 22:59:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25959 to 25090. [2019-12-27 22:59:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25090 states. [2019-12-27 22:59:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25090 states to 25090 states and 75894 transitions. [2019-12-27 22:59:54,662 INFO L78 Accepts]: Start accepts. Automaton has 25090 states and 75894 transitions. Word has length 55 [2019-12-27 22:59:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:59:54,663 INFO L462 AbstractCegarLoop]: Abstraction has 25090 states and 75894 transitions. [2019-12-27 22:59:54,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:59:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 25090 states and 75894 transitions. [2019-12-27 22:59:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:59:54,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:59:54,691 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] [2019-12-27 22:59:54,692 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:59:54,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:59:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash -51181904, now seen corresponding path program 1 times [2019-12-27 22:59:54,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:59:54,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693449933] [2019-12-27 22:59:54,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:59:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:59:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:59:54,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:59:54,848 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:59:54,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_43 0) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~weak$$choice0~0_8) (= v_~y~0_18 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2519~0.base_19| 4)) (= 0 v_~x$w_buff0_used~0_106) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_21) (= |v_#NULL.offset_3| 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2519~0.base_19|) (= 0 v_~__unbuffered_p0_EAX~0_18) (= v_~x~0_26 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~x$flush_delayed~0_13 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~x$w_buff0~0_26) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$read_delayed~0_6) (= (store .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_19| 1) |v_#valid_54|) (= 0 v_~weak$$choice2~0_33) (= 0 |v_ULTIMATE.start_main_~#t2519~0.offset_16|) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$r_buff0_thd1~0_71) (= 0 v_~x$r_buff0_thd3~0_20) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2519~0.base_19| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2519~0.base_19|) |v_ULTIMATE.start_main_~#t2519~0.offset_16| 0)) |v_#memory_int_23|) (= v_~x$r_buff1_thd3~0_18 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~z~0_17 0) (= v_~x$r_buff1_thd2~0_20 0) (= v_~main$tmp_guard0~0_11 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_19|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ULTIMATE.start_main_~#t2519~0.base=|v_ULTIMATE.start_main_~#t2519~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_~#t2519~0.offset=|v_ULTIMATE.start_main_~#t2519~0.offset_16|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, #length=|v_#length_25|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_21|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_26, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2519~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2519~0.offset, ULTIMATE.start_main_~#t2521~0.base, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2520~0.base, ULTIMATE.start_main_~#t2521~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2520~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:59:54,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2520~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2520~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2520~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13|) |v_ULTIMATE.start_main_~#t2520~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2520~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2520~0.offset, ULTIMATE.start_main_~#t2520~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 22:59:54,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_35) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 22:59:54,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2521~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2521~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2521~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13| 1) |v_#valid_32|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13|) |v_ULTIMATE.start_main_~#t2521~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2521~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2521~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2521~0.base, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:59:54,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1334762387 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1334762387 256)))) (or (and (= ~x~0_In1334762387 |P2Thread1of1ForFork1_#t~ite32_Out1334762387|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1334762387 |P2Thread1of1ForFork1_#t~ite32_Out1334762387|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1334762387, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1334762387, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1334762387, ~x~0=~x~0_In1334762387} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1334762387|, ~x$w_buff1~0=~x$w_buff1~0_In1334762387, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1334762387, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1334762387, ~x~0=~x~0_In1334762387} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:59:54,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:59:54,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1957473785 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1957473785 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1957473785 |P2Thread1of1ForFork1_#t~ite34_Out-1957473785|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1957473785|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1957473785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1957473785} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1957473785|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1957473785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1957473785} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:59:54,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In466475286 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In466475286 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In466475286 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In466475286 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out466475286| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In466475286 |P2Thread1of1ForFork1_#t~ite35_Out466475286|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In466475286, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In466475286, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In466475286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In466475286} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out466475286|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In466475286, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In466475286, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In466475286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In466475286} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:59:54,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1910178788 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1910178788 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1910178788|)) (and (= ~x$r_buff0_thd3~0_In1910178788 |P2Thread1of1ForFork1_#t~ite36_Out1910178788|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1910178788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1910178788} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1910178788|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1910178788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1910178788} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:59:54,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In1078342637 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1078342637 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1078342637 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1078342637 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1078342637| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1078342637| ~x$r_buff1_thd3~0_In1078342637)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1078342637, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1078342637, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1078342637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078342637} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1078342637|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1078342637, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1078342637, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1078342637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078342637} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:59:54,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:59:54,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1728932503 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out1728932503| ~x$w_buff1~0_In1728932503) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In1728932503| |P0Thread1of1ForFork2_#t~ite11_Out1728932503|)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out1728932503| |P0Thread1of1ForFork2_#t~ite12_Out1728932503|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1728932503 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1728932503 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1728932503 256))) (= (mod ~x$w_buff0_used~0_In1728932503 256) 0))) (= |P0Thread1of1ForFork2_#t~ite11_Out1728932503| ~x$w_buff1~0_In1728932503)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1728932503, ~x$w_buff1~0=~x$w_buff1~0_In1728932503, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1728932503, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1728932503, ~weak$$choice2~0=~weak$$choice2~0_In1728932503, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1728932503|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728932503} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1728932503, ~x$w_buff1~0=~x$w_buff1~0_In1728932503, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1728932503, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1728932503, ~weak$$choice2~0=~weak$$choice2~0_In1728932503, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1728932503|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1728932503|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728932503} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:59:54,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-726205004 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out-726205004| ~x$w_buff0_used~0_In-726205004) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-726205004| |P0Thread1of1ForFork2_#t~ite14_Out-726205004|)) (and (= ~x$w_buff0_used~0_In-726205004 |P0Thread1of1ForFork2_#t~ite14_Out-726205004|) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-726205004| |P0Thread1of1ForFork2_#t~ite14_Out-726205004|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-726205004 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-726205004 256))) (and (= 0 (mod ~x$r_buff1_thd1~0_In-726205004 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-726205004 256) 0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-726205004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-726205004, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-726205004, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-726205004|, ~weak$$choice2~0=~weak$$choice2~0_In-726205004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-726205004} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-726205004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-726205004, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-726205004|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-726205004, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-726205004|, ~weak$$choice2~0=~weak$$choice2~0_In-726205004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-726205004} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:59:54,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_21, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:59:54,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In693218073 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out693218073| ~x$r_buff1_thd1~0_In693218073) (= |P0Thread1of1ForFork2_#t~ite23_In693218073| |P0Thread1of1ForFork2_#t~ite23_Out693218073|)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out693218073| ~x$r_buff1_thd1~0_In693218073) .cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out693218073| |P0Thread1of1ForFork2_#t~ite23_Out693218073|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In693218073 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In693218073 256))) (= 0 (mod ~x$w_buff0_used~0_In693218073 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In693218073 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In693218073, ~x$w_buff1_used~0=~x$w_buff1_used~0_In693218073, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In693218073, ~weak$$choice2~0=~weak$$choice2~0_In693218073, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In693218073|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In693218073} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In693218073, ~x$w_buff1_used~0=~x$w_buff1_used~0_In693218073, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In693218073, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out693218073|, ~weak$$choice2~0=~weak$$choice2~0_In693218073, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out693218073|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In693218073} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 22:59:54,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_5 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:59:54,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-206117564 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-206117564 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-206117564 |P1Thread1of1ForFork0_#t~ite28_Out-206117564|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-206117564|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-206117564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206117564} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-206117564, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-206117564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206117564} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:59:54,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1051126137 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1051126137 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1051126137 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1051126137 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out1051126137| ~x$w_buff1_used~0_In1051126137)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1051126137|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1051126137, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1051126137, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1051126137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1051126137} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1051126137, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1051126137, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1051126137, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1051126137|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1051126137} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:59:54,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1372490426 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1372490426 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-1372490426 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1372490426 ~x$r_buff0_thd2~0_In-1372490426)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1372490426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1372490426} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1372490426|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1372490426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1372490426} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:59:54,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In552077491 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In552077491 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In552077491 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In552077491 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out552077491| ~x$r_buff1_thd2~0_In552077491)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out552077491| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In552077491, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In552077491, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In552077491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In552077491} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out552077491|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In552077491, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In552077491, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In552077491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In552077491} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:59:54,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L777-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:59:54,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:59:54,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1948847895 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1948847895 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite41_Out1948847895| |ULTIMATE.start_main_#t~ite42_Out1948847895|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out1948847895| ~x$w_buff1~0_In1948847895) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite41_Out1948847895| ~x~0_In1948847895)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1948847895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1948847895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1948847895, ~x~0=~x~0_In1948847895} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1948847895|, ~x$w_buff1~0=~x$w_buff1~0_In1948847895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1948847895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1948847895, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1948847895|, ~x~0=~x~0_In1948847895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:59:54,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2133410968 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2133410968 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out2133410968| ~x$w_buff0_used~0_In2133410968) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out2133410968|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133410968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133410968} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133410968, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2133410968|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133410968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:59:54,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1386428330 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1386428330 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1386428330 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1386428330 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1386428330|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1386428330 |ULTIMATE.start_main_#t~ite44_Out1386428330|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1386428330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386428330, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1386428330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386428330} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1386428330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386428330, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1386428330, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1386428330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386428330} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:59:54,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2033338547 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-2033338547 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-2033338547|)) (and (= ~x$r_buff0_thd0~0_In-2033338547 |ULTIMATE.start_main_#t~ite45_Out-2033338547|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2033338547, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033338547} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2033338547, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2033338547|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033338547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:59:54,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-283483698 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-283483698 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-283483698 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-283483698 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-283483698| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-283483698 |ULTIMATE.start_main_#t~ite46_Out-283483698|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-283483698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283483698, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-283483698, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283483698} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-283483698, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-283483698|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283483698, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-283483698, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283483698} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:59:54,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_19 |v_ULTIMATE.start_main_#t~ite46_13|) (= 2 v_~z~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:59:54,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:59:54 BasicIcfg [2019-12-27 22:59:54,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:59:54,992 INFO L168 Benchmark]: Toolchain (without parser) took 115224.28 ms. Allocated memory was 145.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.7 MB in the beginning and 611.0 MB in the end (delta: -509.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 22:59:54,996 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:59:54,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.15 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:59:54,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.96 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:59:54,997 INFO L168 Benchmark]: Boogie Preprocessor took 47.30 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:59:54,998 INFO L168 Benchmark]: RCFGBuilder took 794.18 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 105.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:59:54,998 INFO L168 Benchmark]: TraceAbstraction took 113570.90 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 104.8 MB in the beginning and 611.0 MB in the end (delta: -506.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 22:59:55,006 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.15 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.96 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.30 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.18 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 105.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113570.90 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 104.8 MB in the beginning and 611.0 MB in the end (delta: -506.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 162 ProgramPointsBefore, 85 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 6364 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75290 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2519, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2520, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2521, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 113.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 58.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5405 SDtfs, 8612 SDslu, 20747 SDs, 0 SdLazy, 24153 SolverSat, 950 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 705 GetRequests, 221 SyntacticMatches, 61 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7761 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120798occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 428331 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 874 ConstructedInterpolants, 0 QuantifiedInterpolants, 143838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...